Edge chromatic index and edge-sum chromatic index for families of integral sum graphs

MaRDI QIDQ6428864zbMATH OpenFDO

Authors Priyanka B R, Biswajit Pandit, Rajeswari M

Publication date 8 March 2023

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Abstract: We consider class of integral sum graphs $H_{m,j}^{-i,s}$ subject to the conditions $-i<0<s$, $1leqm<i$ and $1leqj<s$ for all $i,s,m,jinmathbbN$. We apply edge-sum coloring and edge coloring on $H_{m,j}^{-i,s}$. Since the graphs fully depend on $i$ and $s$, therefore it is not easy to derive the theoretical as well as numerical results for all values of $i$ and $s$. Here, we derive the general formula for computing the minimum number of independent color classes. We compute the edge chromatic as well as edge-sum chromatic number of $H_{m,j}^{-i,s}$ corresponding to different values of $i$, $s$, $m$ and $j$. We also compare these two techniques. We place the numerical results to verify the theoretical results.

This page was built for publication: Edge chromatic index and edge-sum chromatic index for families of integral sum graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6428864)