Local coloring of self complementary graphs

Let be a graph. A local coloring of a graph of order at least 2 is a function having the property that for each set with , there exist vertices such that , where is the size of the induced subgraph . The maximum color assigned by a local coloring to a vertex of is called the value of and is denoted...

Full description

Bibliographic Details
Main Authors:	P. Deepa, P. Srinivasan, M. Sundarakannan
Format:	Article
Language:	English
Published:	Taylor & Francis Group 2017-04-01
Series:	AKCE International Journal of Graphs and Combinatorics
Subjects:	coloring local coloring local chromatic number self complementary graph
Online Access:	http://dx.doi.org/10.1016/j.akcej.2016.11.005

id	doaj-6e66fd6468fe4e619e16120df3812edf
record_format	Article
spelling	doaj-6e66fd6468fe4e619e16120df3812edf2020-11-25T03:29:42ZengTaylor & Francis GroupAKCE International Journal of Graphs and Combinatorics0972-86002017-04-01141354110.1016/j.akcej.2016.11.00512092610Local coloring of self complementary graphsP. Deepa0P. Srinivasan1M. Sundarakannan2Department of Mathematics, Prathyusha Institute of Technology and Management, Aranvoyal kuppam, PonamaleeDepartment of Mathematics, The American CollegeDepartment of Mathematics, SSN College of EngineeringLet be a graph. A local coloring of a graph of order at least 2 is a function having the property that for each set with , there exist vertices such that , where is the size of the induced subgraph . The maximum color assigned by a local coloring to a vertex of is called the value of and is denoted by . The local chromatic number of is , where the minimum is taken over all local colorings of . In this paper we study the local coloring for some self complementary graphs. Also we present a sc-graph with local chromatic number for any given integer .http://dx.doi.org/10.1016/j.akcej.2016.11.005coloringlocal coloringlocal chromatic numberself complementary graph
collection	DOAJ
language	English
format	Article
sources	DOAJ
author	P. Deepa P. Srinivasan M. Sundarakannan
spellingShingle	P. Deepa P. Srinivasan M. Sundarakannan Local coloring of self complementary graphs AKCE International Journal of Graphs and Combinatorics coloring local coloring local chromatic number self complementary graph
author_facet	P. Deepa P. Srinivasan M. Sundarakannan
author_sort	P. Deepa
title	Local coloring of self complementary graphs
title_short	Local coloring of self complementary graphs
title_full	Local coloring of self complementary graphs
title_fullStr	Local coloring of self complementary graphs
title_full_unstemmed	Local coloring of self complementary graphs
title_sort	local coloring of self complementary graphs
publisher	Taylor & Francis Group
series	AKCE International Journal of Graphs and Combinatorics
issn	0972-8600
publishDate	2017-04-01
description	Let be a graph. A local coloring of a graph of order at least 2 is a function having the property that for each set with , there exist vertices such that , where is the size of the induced subgraph . The maximum color assigned by a local coloring to a vertex of is called the value of and is denoted by . The local chromatic number of is , where the minimum is taken over all local colorings of . In this paper we study the local coloring for some self complementary graphs. Also we present a sc-graph with local chromatic number for any given integer .
topic	coloring local coloring local chromatic number self complementary graph
url	http://dx.doi.org/10.1016/j.akcej.2016.11.005
work_keys_str_mv	AT pdeepa localcoloringofselfcomplementarygraphs AT psrinivasan localcoloringofselfcomplementarygraphs AT msundarakannan localcoloringofselfcomplementarygraphs
_version_	1724577675363745792

Local coloring of self complementary graphs

Similar Items