AU - Babu, P Shanas
AU - A V, Chithra
TI - A Note on Acyclic Coloring of Strong Product of Graphs
PT - JOURNAL ARTICLE
TA - IJMSI
JN - IJMSI
VO - 19
VI - 1
IP - 1
4099 - http://ijmsi.ir/article-1-1743-en.html
4100 - http://ijmsi.ir/article-1-1743-en.pdf
SO - IJMSI 1
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.
CP - IRAN
IN - Department of Mathematics, National Institute of Technology, Calicut, Kerala, India-673601
LG - eng
PB - IJMSI
PG - 149
PT - Research paper
YR - 2024