TY - JOUR
AU - Thakare, Sunil
AU - Bhapkar, Haribhau R.
PY - 2023/09/18
Y2 - 2024/05/18
TI - Incident Vertex \(\pi\)-Coloring of Graphs
JF - Communications in Mathematics and Applications
JA - Comm. Math. Appl.
VL - 14
IS - 2
SE - Research Article
DO - 10.26713/cma.v14i2.2215
UR - http://www.rgnpublications.com/journals/index.php/cma/article/view/2215
SP - 591 - 604
AB - <p>We defined the concept of \(\pi\)-coloring of graphs and incident vertex \(\pi\) coloring of graphs. The incident vertex \(\pi\) coloring number \((IV \pi CN)\) of graphs is different from all existing coloring techniques. The \(IV \pi CN\) of complete graph \((K_n)\) is \(n\). \(IV \pi CN\) of wheel, star, double star graph are \((n+1)\). Also, \(IV \pi CN\) of friendship, diamond and fan graphs are \(\Delta+1\). The \(IV \pi CN\) of double fan graph is \(\Delta+2\). The \(IV \pi CN\) of complete bipartite graphs \(K_{m,n}\) is \((m+n)\). The \(IV \pi CN\) of bipartite graph is bounded. Moreover, some results associated to enumeration of the number of graphs having equal incident vertex \(\pi\) chromatic number of few families are proved.</p>
ER -