Title : ( 2-Distance chromatic number of some graph products )
Authors: ghazale ghazi , Freydoon Rahbarnia , Mostafa Tavakoli ,
دانلود فایل برای اعضای دانشگاهAccess to full-text not allowed by authors
Abstract
This paper studies the 2-distance chromatic number of some graph product. A coloring of G 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 G is the 2-distance chromatic number and denoted by χ2(G). 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.
Keywords
, 2-Distance coloring, 2-distance chromatic number, graph products.
@article{paperid:1079889,
author = {Ghazi, Ghazale and Rahbarnia, Freydoon and Tavakoli, Mostafa},
title = {2-Distance chromatic number of some graph products},
journal = {Discrete Mathematics, Algorithms and Applications},
year = {2020},
volume = {12},
number = {2},
month = {April},
issn = {1793-8309},
pages = {2050021--2050033},
numpages = {12},
keywords = {2-Distance coloring; 2-distance chromatic number; graph products.},
}
%0 Journal Article
%T 2-Distance chromatic number of some graph products
%A Ghazi, Ghazale
%A Rahbarnia, Freydoon
%A Tavakoli, Mostafa
%J Discrete Mathematics, Algorithms and Applications
%@ 1793-8309
%D 2020
