The Tadpole graph Tm,nalso called a dragon graphs obtained by connecting cycle graph Cmand path graph Pn in series with an edge from any vertex of cycle graph to a pendant of path graph for integers m≥3 and n≥1. In this study, we examine the characteristics of a typical Tadpole graph and its line graph by applying Graph Coloring and Linear Algebraic methods. The (m-1)-tadpole graph is sometimes known as the m-pan graph. The particular cases of the (3,1) and (4,1) tadpole graphs are also known as the paw graph and banner graph, respectively (ISGCI).
Volume 11 | 06-Special Issue
Pages: 857-860