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

Saved in:
Bibliographic Details
Published in:AKCE International Journal of Graphs and Combinatorics 2017-04, Vol.14 (1), p.35-41
Main Authors: Deepa, P., Srinivasan, P., Sundarakannan, M.
Format: Article
Language:English
Subjects:
Coloring
Local chromatic number
Local coloring
Self complementary graph
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 .
ISSN:0972-8600
2543-3474
DOI:10.1016/j.akcej.2016.11.005