2021
DOI: 10.3390/sym13091651
|View full text |Cite
|
Sign up to set email alerts
|

Common Neighborhood Energy of Commuting Graphs of Finite Groups

Abstract: The commuting graph of a finite non-abelian group G with center Z(G), denoted by Γc(G), is a simple undirected graph whose vertex set is G∖Z(G), and two distinct vertices x and y are adjacent if and only if xy=yx. Alwardi et al. (Bulletin, 2011, 36, 49-59) defined the common neighborhood matrix CN(G) and the common neighborhood energy Ecn(G) of a simple graph G. A graph G is called CN-hyperenergetic if Ecn(G)>Ecn(Kn), where n=|V(G)| and Kn denotes the complete graph on n vertices. Two graphs G and H with eq… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
7
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
7
1

Relationship

2
6

Authors

Journals

citations
Cited by 12 publications
(7 citation statements)
references
References 26 publications
0
7
0
Order By: Relevance
“…For future work, the application of this graph to the study on Laplacian eigenvalues of an ideal-based dot total graph, which is closely related to the work in the paper [6], can be investigated. Additionally, the energy of an ideal-based dot total graph, which is related to the recent work in [5,7], requires more consideration. The…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…For future work, the application of this graph to the study on Laplacian eigenvalues of an ideal-based dot total graph, which is closely related to the work in the paper [6], can be investigated. Additionally, the energy of an ideal-based dot total graph, which is related to the recent work in [5,7], requires more consideration. The…”
Section: Discussionmentioning
confidence: 99%
“…Furthermore, if I = (0) in T I (Γ(R)), then T I (Γ(R)) = Γ 0 (R); this graph is studied by Beck [4], in which he considered R as a simple graph for which its vertex set is the set of all elements of R and edge set such that for all distinct x, y ∈ R, e = xy ∈ E(Γ 0 (R)) if and only if xy = 0. In addition, some fundamentals of Laplacian eigenvalues and energy of graphs can be identified in [5][6][7].…”
Section: Introductionmentioning
confidence: 99%
“…Recent results on the commuting graph of generalized dihedral groups can be found in [31] and the references therein. The connectivity and spectral radius of adjacency matrix of commuting graphs were studied in [5], Laplacian and signless Laplacian spectrum of commuting graphs on dihedral groups were investigated in [3], common neighborhood energy of commuting graphs [36]. For other spectral properties of commuting graphs, we refer to [27] and the references therein.…”
Section: Groupsmentioning
confidence: 99%
“…The energy E(G) is the sum of absolute A-eigenvalues of G. A significant amount of research has been conducted on this idea [16]. Following the potential applications of the A-spectrum, numerous topological indices were investigated from a spectral perspective by modifying the classical adjacency matrix accordingly [19][20][21][22][23][24][25][26][27][28][29]. Zhou and Trinajstić [30] introduced the matrix corresponding to the sum-connectivity index and studied associated energy in 2010.…”
Section: Introductionmentioning
confidence: 99%