The Szeged Index Energy of Commuting Graph of Certain Finite Non-commutative Groups

Let G be a finite 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.

Authors

Publication Details

Journal
Advances in Analysis and Applied Mathematics
Published
2024-12-31
DOI
https://doi.org/10.62298/advmath.13
Primary Topic
Graph theory and applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

The Szeged Index Energy of Commuting Graph of Certain Finite Non-commutative Groups

Subarsha Banerjee, Ashok Agarwal
Advances in Analysis and Applied Mathematics
Graph theory and applications
article

The Szeged Index Energy of Commuting Graph of Certain Finite Non-commutative Groups

Subarsha Banerjee, Ashok Agarwal
article en

Abstract

Let G be a finite 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.

Advances in Analysis and Applied Mathematics
Openalex Percentile: Top 62%
Graph theory and applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

The Szeged Index Energy of Commuting Graph of Certain Finite Non-commutative Groups — Subarsha Banerjee, Ashok Agarwal · Advances in Analysis and Applied Mathematics (2024) | TGRS Research Map | TGRS