Search arXivSearch

arXiv · 2608.21062

Characterisations of finite groups with exponent $q$ via their power graphs

Abstract

The power graph $P(G)$ of a finite group $G$ is the graph with vertex set $G$ and edge set $E(P(G))=\{uv:\ u,v \in G,\ u \neq v,\ u \in \langle v \rangle \ \text{or}\ v \in \langle u \rangle\},$ where $\langle x\rangle$ denotes the cyclic subgroup generated by $x$. In this paper, we characterise all the finite groups with exponent $q$ whose power graphs are friendship graphs, firefly-type graphs, or torch graphs. We prove that the power graph of a finite group $G$ with exponent $q$ is a friendship graph if and only if $q=3$. In particular, in the abelian case, this is equivalent to $G\cong\mathbb{Z}_3^{n}$. We further show that, among all the symmetric and alternating groups, only $S_3$ and $A_4$ have firefly-type power graphs, whereas no finite group has a power graph isomorphic to a torch graph. Finally, we determine the generalised distance spectra $D_α$-spectra of these graph classes.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Aditya Singh, Anmol chugh, Yogendra Singh, Anand Kumar Tiwari. 2026-08-21. Characterisations of finite groups with exponent $q$ via their power graphs. https://arxiv.org/abs/2608.21062

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Random algebraic constructions for extremal and Ramsey problems

Building on Bukh's random algebraic method, we develop a framework for extremal and Ramsey problems involving apex hypergraphs. If $\mathcal{H}$ is a $(d-1)$-partite $(d-1)$-uniform hypergraph with $S$ edges and $\mathcal{H}(t)$ is obtained by adjoining $t$ vertices with common link $\mathcal{H}$, we prove that $\operatorname{ex}(n,\mathcal{H}(t))=Ω_{\mathcal{H}}(n^{d-1/S})$ for $t>9^{S+o_d(S)}$, which is best possible when $\mathcal{H}$ is Sidorenko. Our framework also yields sharper sided Zarankiewicz bounds, quantitative generalized Tur'an bounds, and diagonal multicolor Ramsey constructions. For each fixed $s\geq 2$ and $K\geq 3$, we further prove $\operatorname{r}_K(\mathcal K_{s,t};\mathcal K_n) =Θ_{s,t,K}((n/\log n)^s)$ for $t>9^{s+o(s)}$, extending a theorem of Alon and Rödl from factorial to exponential $t$. The main ingredients are interpolation on $m$-independent varieties, control of the dependencies imposed by symmetry, and linear spaces of forms whose nonzero members remain regular after a common algebraic slice. Limited edge independence then gives the spectral and local-density estimates needed for the Ramsey application.

math.CO

A note on vertex-critical induced subgraphs of shift graphs

Shift graphs, introduced by Erdős and Hajnal in 1964, form one of the simplest known non-recursive constructions of triangle-free graphs with arbitrarily large chromatic number. In this note, we identify a surprising property: for each integer $k \geq 1$, the smallest $k$-chromatic shift graph contains a \emph{unique} induced $k$-vertex-critical subgraph. We give an explicit description of this subgraph and prove its uniqueness. This provides a new family of vertex-critical triangle-free graphs of arbitrarily large chromatic number.

math.CO