Affiliation:
1. Department of Applied Mathematics, Ferdowsi University of Mashhad P. O. Box 1159, Mashhad 91775, Iran
Abstract
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.
Publisher
World Scientific Pub Co Pte Lt
Subject
Discrete Mathematics and Combinatorics
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Injective Coloring of Product Graphs;Bulletin of the Malaysian Mathematical Sciences Society;2024-04-04
2. Star chromatic number of some graph products;Discrete Mathematics, Algorithms and Applications;2023-03-22
3. Further results on 2-distance coloring of graphs;Journal of Combinatorial Optimization;2022-11-18
4. On d-distance equitable chromatic number of some graphs;Asian-European Journal of Mathematics;2021-06-25