Further results on 2-distance coloring of graphs

Doost Ali Mojdeh () and Babak Samadi ()
Additional contact information
Doost Ali Mojdeh: University of Mazandaran
Babak Samadi: University of Mazandaran

Journal of Combinatorial Optimization, 2023, vol. 45, issue 1, No 16, 12 pages

Abstract: Abstract Given a graph $$G=\big (V(G),E(G)\big )$$ G = ( V ( G ) , E ( G ) ) , a mapping from V(G) to $$\{1,\ldots ,|V(G)|\}$$ { 1 , … , | V ( G ) | } (the numbers $$1,\ldots ,|V(G)|$$ 1 , … , | V ( G ) | are usually called colors) is said to be a 2-distance coloring of G if any two vertices at distance at most two from each other receive different colors. Such a mapping with the minimum number of colors is said to be an optimal 2-distance coloring of G. The 2-distance chromatic number $$\chi _{2}(G)$$ χ 2 ( G ) of a graph G is the number of colors assigned by an optimal 2-distance coloring to the vertices of G. In this paper, we continue the study of this classic topic in graph theory. The main focus of this work is given to this parameter in some graph products, where we investigate this type of coloring in the strong, direct and rooted products. In particular, in the case of rooted products (in its most general case) we give an exact formula for the 2-distance chromatic number. This improves the results in a previous paper bounding this parameter from below and above in a special case. We next give bounds on this parameter for general graphs as well as the exact values for it in some well-known families of graphs.

Keywords: 2-Distance coloring; Packing; Strong product; Direct product; Rooted product; 05C15; 05C69; 05C76 (search for similar items in EconPapers)
Date: 2023
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-022-00942-2 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:45:y:2023:i:1:d:10.1007_s10878-022-00942-2

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-022-00942-2

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().