A Study of Energy on k-Splitting and k-Shadow Graphs
Keywords:
maximum degree energy, minimum degree energy, Sombor energy, Sombor energyAbstract
Let G=(V,E) be a graph. The k-splitting graph of G, denoted by S_k (G), is a graph constructed by adding to each vertex v of G as many as k new vertices such that the k new vertices are adjacent to the vertices that are adjacent to v. The k-shadow graph of G, denoted by D_k (G), is a graph constructed by taking k copies of G and connecting each of these vertices with each of its neighboring vertices. The energy of a graph G is defined as the sum of the absolute values of all eigenvalues in the matrix for the graph. In this article, we study the energy of the k-splitting graph and the k-shadow graph, which are the energy of the adjacency matrix, the energy of the maximum degree matrix, the energy of the minimum degree matrix. We also revise the Sombor energy of the k-splitting graph and the k-shadow graph and we compare this result with the results carried out by previous researchers.
Downloads
References
A. Prathik, K. Uma and J. Anuradha, "An Overview of application of Graph theory," International Journal of ChemTech Research, vol. 9, no. 2, pp. 242-248, 2016.
R. Likaj, A. Shala, M. Mehmetaj, P. Hyseni and X. Bajrami, "Application of graph theory to find optimal paths for the transportation problem," IFAC Proceedings Volumes, vol. 46, no. 8, pp. 235-240, 2013.
S. Derrible and C. Kennedy, "Applications of graph theory and network science to transit network design," Transport reviews, vol. 31, no. 4, pp. 495-519, 2011.
D. Sensarma and S. Sarma, "Application of graphs in security," International Journal of Innovative Technology and Exploring Engineering, vol. 8, no. 10, pp. 2273-2279, 2019.
A. Kumar and A. Kumar Vats, "Application of graph labeling in crystallography," Materials Today: Proceedings, 2020.
N. Prasanna, K. Sravanthi and N. Sudhakar, "Applications of Graph Labeling in Communication Networks," ORIENTAL JOURNAL OF COMPUTER SCIENCE & TECHNOLOGY, vol. 7, no. 1, pp. 139-145, 2014.
M. Vinutha and P. Arathi, "Applications of Graph Coloring and Labeling in Computer Science," International Journal on Future Revolution in Computer Science & Communication Engineering, vol. 3, no. 8, pp. 14-16, 2017.
G. Chartrand, L. Lesniak and P. Zhang, Graphs and Digraphs, Boca Raton: CRC Press, 2016.
S. Vaidya and K. M. Popat, "Energy of m-Splitting and m-Shadow Graphs," Far East Journal of Mathematical Sciences, vol. 102, no. 8, pp. 1571-1578, 2017.
C. Adiga dan M. Smitha, “On Maximum Degree Energy of a Graph,” Int. J. Contemp. Math. Sciences, vol. 8, no. 385-396, p. 4, 2009.
C. Adiga dan C. S. S. Swamy, “Bounds on The Largest of Minimum Degree Eigenvalues of Graphs,” International Mathematical Forum, vol. 5, no. 37, pp. 1823-1831, 2010.
K. J. Gowtham and N. N. Swamy, "On Sombor energy of graphs," Nanosystems: Phys. Chem. Math, vol. 12, no. 4, pp. 411-417, 2021.
G. K. Gok, "Some Bounds on The Seidel Energy of Graphs," WMS J. App. Eng. Math., vol. 9, no. 4, pp. 949-956, 2019.
M. H. Nezhaad and M. Ghorbani, "Seidel Borderenergetic Graphs," TWMS J. App. Eng. Math., vol. 10, no. 2, pp. 389-399, 2020.
E. Sampathkumar, S. V. Roopa, K. A. Vidya and M. A. Sriraj, "Partition Energy of Some Trees and Their Generalized Complements," TWMS J. App. and Eng. Math., vol. 10, no. 2, pp. 521-531, 2020.
I. Gutman, "The Energy of a Graph," Ber. Math. Statist. Sekt. Forsch. Graz, vol. 103, pp. 100-105, 1978.
Z. Chu, S. Nazeer, T. J. Zia, I. Ahmed and S. Shahid., "Some New Results on Various Graph Energies of the Splitting Graph," Journal of Chemistry, 2019.
K. Rao, K. Saravanan, K. N. Prakasha and I. N. Cangul, "Maximum and Minimum Degree Energies of p-Splitting and p-Shadow Graphs," TWMS J. App. and Eng. Math., vol. 12, no. 1, pp. 1-10, 2022.
R. Singh and S. C. Patekar, "On Sombor Index and Sombor Energy of m-Splitting Graphs and m-Shadow Graphs of Regular Graphs," arXiv e-Prints, vol. arXiv: 2205.09480, 2022.
R. A. Horn and C. R. Johnson, Topics in Matrix Analysis, Cambridge: Cambridge Univ. Press, 1991.
