Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
8902787 | AKCE International Journal of Graphs and Combinatorics | 2017 | 7 Pages |
Abstract
Let G=(V,E) be a graph. A local coloring of a graph G of order at least 2 is a function c:V(G)â¶N having the property that for each set SâV(G) with 2â¤|S|â¤3, there exist vertices u,vâS such that |c(u)âc(v)|â¥ms, where ms is the size of the induced subgraph ãSã. The maximum color assigned by a local coloring c to a vertex of G is called the value of c and is denoted by Ïâ(c). The local chromatic number of G is Ïâ(G)=min{Ïâ(c)}, where the minimum is taken over all local colorings c of G. In this paper we study the local coloring for some self complementary graphs. Also we present a sc-graph with local chromatic number k for any given integer kâ¥6.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
P. Deepa, P. Srinivasan, M. Sundarakannan,