Abstract
A star coloring of a graph [Formula: see text] is a proper coloring of [Formula: see text] such that no path of length [Formula: see text] in [Formula: see text] 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have