Local coloring of self complementary graphs

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 beskrivning

Bibliografiska uppgifter
Huvudupphovsmän: P. Deepa, P. Srinivasan, M. Sundarakannan
Materialtyp: Artikel
Språk:English
Publicerad: Taylor & Francis Group 2017-04-01
Serie:AKCE International Journal of Graphs and Combinatorics
Ämnen:
coloring
local coloring
local chromatic number
self complementary graph
Länkar:http://dx.doi.org/10.1016/j.akcej.2016.11.005

Liknande verk

Liknande verk