TY - JOUR
ID - 9056
TI - A new approach to compute acyclic chromatic index of certain chemical structures
JO - Iranian Journal of Mathematical Chemistry
JA - IJMC
LA - en
SN - 2228-6489
AU - Rajasingh, I.
AU - Rajan, R.
AU - Paul, D.
AD - School of Advanced Sciences, VIT University, Chennai-600127, India
Y1 - 2015
PY - 2015
VL - 6
IS - 1
SP - 51
EP - 61
KW - Acyclic edge-coloring
KW - Acyclic chromatic index
KW - Maximum degree
KW - Certain chemical structures
DO - 10.22052/ijmc.2015.9056
N2 - An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph $G$ denoted by $chi_a '(G)$ is the minimum number $k$ such that there is an acyclic edge coloring using $k$ colors. The maximum degree in $G$ denoted by $Delta(G)$, is the lower bound for $chi_a '(G)$. $P$-cuts introduced in this paper acts as a powerful tool to prove that this bound is sharp for certain chemical structures.
UR - http://ijmc.kashanu.ac.ir/article_9056.html
L1 - http://ijmc.kashanu.ac.ir/article_9056_8441113ee648b7051f3b05875d262234.pdf
ER -