Star coloring under some graph operations

چکیده مقاله

A star coloring of a graph G is 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.