Abstract

In this research article, we derive density expressions explicitly for families of K4-snake graphs and other graph structures together with their corona products. We investigate Closed-form formulas for the density of m-complete snake graphs, double and alternate snake graphs, subdivision of families of snake graphs, barbell graph, friendship graph, and double triangular snake graph. Furthermore, we obtain the density of corona products for barbell graph, friendship graph, and double triangular snake graph with complete graph K1 and identical graph copies. These findings provide consolidated expressions that narrate how density behaves under structural changes such as double, alternation, subdivision, and corona operations. The established formulas contribute to the theoretical study of graph density and extend existing work on density behavior in composite graph operations, as they gives a deeper insight into graph density behavior under various graph structures.

Keywords

Alternate snake graph, Corona product, Double snake graph, Graph density, Snake graph.

References

[1] Jonathan L. Gross, and Jay Yellen, Graph Theory and Its Applications, CRC Press, Boca Raton, 2006.
[Google Scholar] [Publisher Link]

[2] Racma L. Sango, and Isagani S. Cabahug, “Density of the Shadow Graph of Some Graphs and the Join of Graphs,” Advances & Applications in Discrete Mathematics, vol. 42, no. 6, pp. 613-620, 2025.
 [CrossRef] [Google Scholar] [Publisher Link]

[3] U.M. Prajapati, and A.V. Vantiya, “SD-Prime Cordial Labeling of K₄-Snake and Related Graphs,” Journal of Xidian University, vol. 14, no. 4, pp. 543–551, 2020.
[CrossRef] [Google Scholar] [Publisher Link]

[4] Udayan M. Prajapati and Vantiya Anitkumar Vasantlal, “SD-Prime Cordial Labeling of Subdivision K₄-Snake and Related Graphs,” TWMS Journal of Applied and Engineering Mathematics, vol. 13, no. 1, pp. 386-399, 2023.
[Google Scholar] [Publisher Link]

[5] Ariestha Widyastuty Bustan et al., “The Locating Rainbow Connection Numbers of Lollipop and Barbell Graphs,” J. Math. Appl., vol. 19, no. 4, pp. 2727–2738, 2025.
[CrossRef] [Google Scholar] [Publisher Link]

[6] Joseph A. Gallian, “A Dynamic Survey of Graph Labeling,” Electronic Journal of Combinatorics, pp. 4-623, 2022.
[Google Scholar] [Publisher Link]

[7] F. Fran et al., “The Complexity of Octopus Graph, Friendship Graph, and Snail Graph,” Journal of Education, Mathematics, and Science, vol. 9, no. 1, pp. 84-101, 2024.
[Google Scholar]

[8] Roberto Frucht, and Frank Hararvy, “On the Corona of Two Graphs,” Mathematical Equations, vol. 4, no. 3, pp. 322–325, 1970.
[Google Scholar] [Publisher Link]

[9] Racma L. Sango, and Isagani S. Cabahug, “On the Density of Some Graphs and Corona Graphs,” Asian Research Journal of Mathematics, vol. 21, no. 6, pp. 1-6, 2025.
[CrossRef] [Google Scholar] [Publisher Link]