The Locating Chromatic Number of Book Graph
Let G = V G , E G be a connected graph and c : V G ⟶ 1,2 , … , k be a proper k -coloring of G . Let Π be a partition of vertices of G induced by the coloring c . We define the color code c Π v of a vertex v ∈ V G as an ordered k -tuple that contains the distance between each partition to the vertex v . If distinct vertices have distinct color code, then c is called a locating k -coloring of G . The locating chromatic number of G is the smallest k such that G has a locating k -coloring. In this paper, we determine the locating chromatic number of book graph.
Keyword(s):
Keyword(s):
Keyword(s):
Keyword(s):
1992 ◽
Vol 1
(4)
◽
pp. 335-349
◽
Keyword(s):
2012 ◽
Vol 11
(06)
◽
pp. 1250114
◽
Keyword(s):
2010 ◽
Vol 02
(04)
◽
pp. 437-444
◽
Keyword(s):
2010 ◽
Vol 02
(02)
◽
pp. 207-211
◽
Keyword(s):
2003 ◽
Vol 2003
(46)
◽
pp. 2947-2959