Common Neighborhood Energy of the Non-Commuting Graphs and Commuting Graphs Associated with Dihedral and Generalized Quaternion Groups

This paper explores the common neighborhood energy (ECN(Γ)) of graphs derived from the dihedral group D2n and generalized quaternion group Q4n, specifically the non-commuting graph (NCM-graph) and the commuting graph (CM-graph). Studying graphs associated with groups offers a powerful approach to translating algebraic properties into combinatorial structures, enabling the application of graph-theoretic tools to understand group behavior. The common neighborhood energy, defined as the sum of the absolute values of the eigenvalues of the common neighborhood (CN) matrix, i.e., ∑i=1p|ζi|, where {ζi}i=1p are the CN eigenvalues, provides insights into the structural properties of these graphs. We derive explicit formulas for the CN characteristic polynomials and corresponding CN eigenvalues for both the NCM-graph and CM-graph as functions of n. Consequently, we establish closed-form expressions for the ECN of these graphs, which are parameterized by n. The validity of our theoretical results is confirmed through computational examples. This study contributes to the spectral analysis of algebraic graphs, demonstrating a direct connection between the group-theoretic structure of D2n and Q4n, as well as the combinatorial energy of their associated graphs, thus furthering the understanding of group properties through spectral graph theory.

Authors

Institutions

Publication Details

Journal
Mathematics
Published
2025-05-30
DOI
https://doi.org/10.3390/math13111834
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

Common Neighborhood Energy of the Non-Commuting Graphs and Commuting Graphs Associated with Dihedral and Generalized Quaternion Groups

Hanaa Alashwali, Anwar Saleh
Mathematics
Graph theory and applications
article

Common Neighborhood Energy of the Non-Commuting Graphs and Commuting Graphs Associated with Dihedral and Generalized Quaternion Groups

Hanaa Alashwali, Anwar Saleh
article en

Abstract

This paper explores the common neighborhood energy (ECN(Γ)) of graphs derived from the dihedral group D2n and generalized quaternion group Q4n, specifically the non-commuting graph (NCM-graph) and the commuting graph (CM-graph). Studying graphs associated with groups offers a powerful approach to translating algebraic properties into combinatorial structures, enabling the application of graph-theoretic tools to understand group behavior. The common neighborhood energy, defined as the sum of the absolute values of the eigenvalues of the common neighborhood (CN) matrix, i.e., ∑i=1p|ζi|, where {ζi}i=1p are the CN eigenvalues, provides insights into the structural properties of these graphs. We derive explicit formulas for the CN characteristic polynomials and corresponding CN eigenvalues for both the NCM-graph and CM-graph as functions of n. Consequently, we establish closed-form expressions for the ECN of these graphs, which are parameterized by n. The validity of our theoretical results is confirmed through computational examples. This study contributes to the spectral analysis of algebraic graphs, demonstrating a direct connection between the group-theoretic structure of D2n and Q4n, as well as the combinatorial energy of their associated graphs, thus furthering the understanding of group properties through spectral graph theory.

MathematicsVol. 13(11)
King Abdulaziz University (SA), University of Jeddah (SA)
Openalex Percentile: Top 83%
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.