Skip to content
Open access

Algebraic Connectivity of Enhanced Power Graphs.

2026 · International Journal of Mathematical and Computer Sciences · 0 citations · 7 references

Abstract

Let G be a finite group and let {\cal P}_e(G) denote its enhanced power graph. Thus two distinct group elements are adjacent whenever they lie in a common cyclic subgroup. This paper studies the algebraic connectivity of {\cal P}_e(G), that is, the second smallest eigenvalue of its Laplacian matrix. Since the identity element is adjacent to every vertex, {\cal P}_e(G) is the join of a single vertex and the proper enhanced power graph obtained by deleting the identity. We use this observation to reduce the algebraic connectivity problem to the Laplacian spectrum of the proper enhanced power graph. Exact Laplacian spectra, and consequently algebraic connectivity values, are obtained for cyclic groups, elementary Abelian p-groups, and dihedral groups. We also establish a monotonicity relation comparing proper power graphs and proper enhanced power graphs. In particular, the algebraic connectivity equals *1 precisely when deletion of the identity disconnects the enhanced power graph.

Read PDF

Similar papers

Open access Sep 2026

Connectivity and Distance Properties of Zero-Divisor Graphs of Finite Commutative Semilocal Rings

The zero-divisor graph of a commutative ring provides a natural connection between algebraic and graph-theoretic structures. Although extensive research has been conducted on the algebraic and combinatorial properties of zero-divisor graphs, their connectivity and metric properties over finite semilocal rings remain co...

Presley Kiplagat · 0 citations
Open access Oct 2026

Connectivity of Power Graphs of Cyclic Groups with Specific Orders

The power graph is defined as a graph whose vertexset consists of the elements of a group, where two vertices arejoined by an edge if one element is a power of the other. In thisresearch we discuss the power graph of a cyclic group of order n=pq, with p and q distinct prime numbers, illustrates theconnectivity among it...

Riyanto, Arif Munandar · 0 citations
Preprint Oct 2026

Additive energy and Fourier complexity of graphs

We study the additive energy and the Fourier approximation of graph adjacency matrices labeled by a cyclic group. For a graph with $N$ vertices, $s$ edges and adjacency matrix $M$, the additive energy of its directed edge set is at most $\min\{(2s)^3,N^2\operatorname{tr}(M^4)\}$, and equality in the spectral bound hold...

V. Gupta, S. Ferguson, A. Iosevich et al. · 0 citations
Open access Oct 2026

Complete Laplacian Spectra and Rigidity of Enhanced Power Graphs

Let p be prime, a>=2, m>=2, and gcd(p,m)=1. Using the Chinese remainder theorem, we study the enhanced power graph of G_{a,p,m}=(C_{p^a} x C_p) x C_m. The mixed-order family is the lexicographic product Gamma_{a,p}[K_m], where Gamma_{a,p}=E(C_{p^a} x C_p). This gives a two-stage compression mp^{a+1}->p^{a+1}->2a and yi...

Luis Alfredo Dupont-García, José Juan Muñoz León, Ángel Fernando Argüello et al. · 0 citations
Preprint Oct 2026

Transposition Cayley Spectra and Subgraph Counts

Let $G$ be a finite simple graph on the vertex set $[n]$, and let $\Gamma(G)$ be the Cayley graph of the symmetric group $S_n$ generated by the transpositions corresponding to the edges of $G$. We study the inverse spectral problem for the assignment $G\mapsto \Gamma(G)$ through the group-algebra operator $A_G=\sum_{\{...

Boris Shapiro · 0 citations
Preprint Sep 2026

Punctured adjacency-degree algebras of Cartesian products

For a connected regular graph G and a vertex a, we study the algebra generated by the adjacency and degree matrices of G-a and its cyclic module P_a generated by the all-ones vector. Our main theorem determines dim P_a for Cartesian products whose factors have equitable distance partitions at the chosen roots. A normal...

Zhi-Peng Lu · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.