A New Approach to Compute Acyclic Chromatic Index of Certain Chemical Structures

نویسندگان
Rajasingh, I. ID 1
Rajan, R. ID 2
Paul, D. ID 3

1 School of Advanced Sciences, VIT University, Chennai-600127, India

2 School of Advanced Sciences, VIT University, Chennai-600127, India

3 School of Advanced Sciences, VIT University, Chennai-600127, India

doi
10.22052/ijmc.2015.9056
چکیده

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.

کلیدواژه‌ها
Acyclic edge-coloring, Acyclic chromatic index, Maximum degree, Certain chemical structures