2-Distance chromatic number of some graph products
2020 ◽
Vol 12
(02)
◽
pp. 2050021
Keyword(s):
This paper studies the 2-distance chromatic number of some graph product. A coloring of [Formula: see text] is 2-distance if any two vertices at distance at most two from each other get different colors. The minimum number of colors in the 2-distance coloring of [Formula: see text] is the 2-distance chromatic number and denoted by [Formula: see text]. In this paper, we obtain some upper and lower bounds for the 2-distance chromatic number of the rooted product, generalized rooted product, hierarchical product and we determine exact value for the 2-distance chromatic number of the lexicographic product.
2012 ◽
Vol 49
(2)
◽
pp. 156-169
◽
Keyword(s):
2014 ◽
Vol 2014
◽
pp. 1-4
◽
Keyword(s):
Keyword(s):
2004 ◽
Vol 14
(01n02)
◽
pp. 105-114
◽
Keyword(s):
2003 ◽
Vol Vol. 6 no. 1
◽