RT - Journal Article
T1 - A Note on Acyclic Coloring of Strong Product of Graphs
JF - IJMSI
YR - 2024
JO - IJMSI
VO - 19
IS - 1
UR - http://ijmsi.ir/article-1-1743-en.html
SP - 149
EP - 160
K1 - Strong product of graphs
K1 - Acyclic coloring
K1 - Acyclic chromatic number.
AB - A vertex coloring of a graph G is called acyclic if no two adjacent vertices have the same color and no cycle in G is bichromatic. The acyclic chromatic number a(G) of a graph G is the least number of colors in an acyclic coloring of G. In this paper, we obtain bound for the acyclic chromatic number of the strong product of a tree and a graph. An exact value for the acyclic chromatic number of the strong product of two trees is derived. Further observations are made on the upper bound for the strong product of three paths.
LA eng
UL http://ijmsi.ir/article-1-1743-en.html
M3 10.61186/ijmsi.19.1.149
ER -