The Szeged Index & Energy of Commuting Graph of Certain Finite Non-commutative Groups
DOI:
https://doi.org/10.62298/advmath.13Keywords:
Commuting Graph, Non-Commutative Group, Szeged Index, Energy, Adjacency Matrix, EigenvaluesAbstract
Let G be a nite group having center Z(G). The commuting graph of G denoted by C(G) has vertex set as G\Z(G), and two vertices x and y are adjacent in C(G) if x and y commute with each other. The commuting graph of a finite group is a powerful tool in group theory to understand the internal structure of the group. Through its graph-theoretic properties, the commuting graph helps in classifying groups and understanding how the group works internally. It serves as a visual and computational tool to complement other algebraic methods in group theory. The Szeged index is a topological index used in the study of molecular structures, particularly in chemistry and chemical graph theory. It is a numerical value that characterizes the connectivity of a molecular graph. In this paper, we have determined the Szeged index of the commuting graph of various finite non-commutative groups, namely the dihedral group Dn, and the dicyclic group Dicn. Moreover, we determine the energy of C(Dn) and C(Dicn). A graph is said to be hyperenergetic if the energy of G is greater than the complete graph. In this paper, we prove that the graphs C(Dn) and C(Dicn) are non-hyperenergetic graphs.
References
[1] M. Knor, R. Škrekovski and A. Tepeh, Mathematical aspects of Wiener index, Ars Math. Contemp., 11(2) (2016), 327–352. [CrossRef] [Scopus] [Web of Science]
[2] I. Gutman, Y.-N. Yeh, S.-L. Lee and Y.-L. Luo, Some recent results in the theory of the Wiener number, Indian J. Chem. - Inorg. Phys. Theor. Anal. Chem., 32(8) (1993), 651–661. [Web of Science]
[3] I. Gutman and N. Trinajstić, Graph theory and molecular orbitals. Total φ-electron energy of alternant hydrocarbons, Chem. Phys. Lett., 17(4) (1972), 535–538. [CrossRef] [Scopus]
[4] I. Gutman, B.R. Ić, N. Trinajstić and C.F. Wilcox Jr., Graph theory and molecular orbitals. XII. Acyclic polyenes, J. Chem. Phys., 62(9) (1975), 3399–3405. [CrossRef] [Scopus]
[5] A.A. Dobrynin and I. Gutman, On a graph invariant related to the sum of all distances in a graph, Publ. Inst. Math. (Beograd) (N.S.), 56(70) (1994), 18-22. [Web]
[6] I. Gutman, A formula for the Wiener number of trees and its extension to graphs containing cycles, Graph Theory Notes N. Y., 27(9) (1994), 9–15.
[7] P.V. Khadikar, S. Karmarkar and R.G. Varma, On the estimation of PI index of polyacenes, Acta Chim. Slov., 49(4) (2002), 755–772. [Scopus] [Web of Science]
[8] A.A. Dobrynin, I. Gutman and G. Dömötör, A Wiener-type graph invariant for some bipartite graphs, Appl. Math. Lett., 8(5) (1995), 57–62. [CrossRef] [Scopus] [Web of Science]
[9] D.B. West, Introduction to Graph Theory, 2. Prentice Hall Upper Saddle River, NJ, 81996).
[10] S. Klavžar, A. Rajapakse and I. Gutman, The Szeged and the Wiener index of graphs, Appl. Math. Lett., 9(5) (1996), 45–49. [CrossRef] [Scopus] [Web of Science]
[11] H. Wiener, Structural determination of paraffin boiling points, J. Am. Chem. Soc., 69(1) (1947), 17–20. [Scopus]
[12] I. Gutman and O.E. Polansky, Mathematical Concepts in Organic Chemistry, Springer Science & Business Media, (2012). [CrossRef]
[13] I. Lukovits, Correlation between components of the Wiener index and partition coefficients of hydrocarbons, Int. J. Quantum Chem., 44(S19) (1992), 217–223. [CrossRef] [Scopus] [Web of Science]
[14] I. Lukovits, Wiener indices and partition coefficients of unsaturated hydrocarbons, Quantitative Structure-Activity Relationships, 9(3) (1990), 227–231. [CrossRef] [Scopus]
[15] I. Gutman and A.A. Dobrynin, The Szeged index–a success story, Graph Theory Notes N. Y., 34(1998), 37–44. [Web]
[16] I. Gutman, P.V. Khadikar, P.V. Rajput and S. Karmarkar, The Szeged index of polyacenes, J. Serb. Chem. Soc., 60 (1995), 759–759. [Web]
[17] M.H. Khalifeh, H. Yousefi-Azari and A.R. Ashrafi, A matrix method for computing Szeged and vertex PI indices of join and composition of graphs, Linear Algebra Its Appl., 429(11-12) (2008), 2702–2709. [CrossRef] [Scopus] [Web of Science]
[18] T. Mansour and M. Schork, The vertex PI index and Szeged index of bridge graphs, Discret. Appl. Math., 157(7) (2009), 1600–1606. [CrossRef] [Scopus] [Web of Science]
[19] S. Banerjee, The Szeged index of power graph of finite groups, TWMS J. Appl. Eng. Math., In Press.
[20] H. Liu, On revised Szeged index of a class of unicyclic graphs, Discrete Math. Algorithms Appl., 14(02) (2022), 2150115. [CrossRef] [Scopus] [Web of Science]
[21] T.T. Chelvam, K. Selvakumar and S. Raja, Commuting graphs on dihedral group, J. Math. Comput. Sci., 2(2) (2011), 402–406. [CrossRef] [Web of Science]
[22] F. Ali, M. Salman and S. Huang, On the commuting graph of dihedral group, Commun. Algebra., 44(6) (2016), 2389–2401. [CrossRef] [Scopus] [Web of Science]
[23] S.M.S. Khasraw, I.D. Ali and R.R. Haji, On the non-commuting graph of dihedral group, Electron. J. Graph Theory Appl., 8(2) (2020), 233–239. [CrossRef] [Scopus] [Web of Science]
[24] S. Banerjee, Distance Laplacian spectra of various graph operations and its application to graphs on algebraic structures, J. Algebra Appl., 22(01) (2023), 2350022. [CrossRef] [Scopus] [Web of Science]
[25] M. Torktaz and A.R. Ashrafi, Distance Laplacian spectrum of the commuting graph of finite CA groups, J. Algebraic Syst., 9(2) (2022), 193-201. [CrossRef] [Scopus]
[26] V. Kakkar and G.S. Rawat, Commuting graphs of generalized dihedral groups, Discrete Math. Algorithms Appl., 11(02) (2019), 1950024. [CrossRef] [Scopus] [Web of Science]
[27] S. Banerjee, The metric dimension & distance spectrum of non-commuting graph of dihedral group, Discrete Math. Algorithms Appl., 13(06) (2021), 2150082. [CrossRef] [Scopus] [Web of Science]
[28] N.H. Sarmin, N.I. Alimon and A. Erfanian, Topological indices of the non-commuting graph for generalised quaternion group, Bull. Malays. Math. Sci. Soc., 43(5) (2020), 3361–3367. [CrossRef] [Scopus] [Web of Science]
[29] M. Mirzargar and A.R. Ashrafi, Some distance-based topological indices of a non-commuting graph, Hacet. J. Math. Stat., 41(4) (2012), 515–526. [Scopus] [Web of Science]
[30] H.B. Walikar, H.S. Ramane and P.R. Hampiholi, On the Energy of a Graph, Graph Connections, Allied Publishers, New Delhi (1999), 120–123.
[31] V. Nikiforov, The energy of graphs and matrices, J. Math. Anal. Appl., 326(2) (2007), 1472–1475. [CrossRef] [Scopus] [Web of Science]
[32] H.B. Walikar, Ivan Gutman, P.R Hampiholi and H.S. Ramane, Non-hyperenergetic graphs, Graph Theory Notes N. Y., 41(14-16) (2001), 1-4. [Web]
[33] J. Chen and L. Tang, The commuting graphs on dicyclic groups, Algebra Colloq., 27(04) (2020), 799–806. [CrossRef] [Scopus] [Web of Science]
[34] S. Banerjee, Perfect codes and universal adjacency spectra of commuting graphs of finite groups, J. Algebra Appl., 22(04) (2023), 2350097. [CrossRef] [Scopus] [Web of Science]
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2024 Subarsha Banerjee, Ankita Agarwal
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
