Iranian Journal of Mathematical Sciences and Informatics
مجله علوم ریاضی و انفورماتیک
IJMSI
Basic Sciences
http://ijmsi.ir
1
admin
1735-4463
2008-9473
8
10.61186/ijmsi
14
8888
13
en
jalali
1403
1
1
gregorian
2024
4
1
19
1
online
1
fulltext
en
A Note on Acyclic Coloring of Strong Product of Graphs
عمومى
General
پژوهشي
Research paper
<div style="text-align: justify;">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.</div>
Strong product of graphs, Acyclic coloring, Acyclic chromatic number.
149
160
http://ijmsi.ir/browse.php?a_code=A-10-5254-1&slc_lang=en&sid=1
P Shanas
Babu
babushanas@gmail.com
`100319475328460010671`

100319475328460010671
Yes
Department of Mathematics, National Institute of Technology, Calicut, Kerala, India-673601
Chithra
A V
chithra@nitc.ac.in
`100319475328460010672`

100319475328460010672
No
Department of Mathematics, National Institute of Technology, Calicut, Kerala, India-673601