A star coloring of a graph Gis a proper coloring of G such that no path of length 3 in G is bicolored. In this paper, the star chromatic number of join of graphs is computed. Some sharp bounds for the star chromatic number of corona, lexicographic, deleted lexicographic and hierarchical product of graphs together with a conjecture on the star chromatic number of lexicographic product of graphs are also presented.
Authors | B. Akhavan Mahdavi , M. Tavakoli , F. Rahbarnia and A. Ashrafi |
---|---|
Journal | Asian-European Journal of Mathematics |
Paper Type | Full Paper |
Published At | 2021 |
Journal Grade | ISI |
Journal Type | Typographic |
Journal Country | Singapore |
Journal Index | Scopus, ISI |
Abstract