Characterisations of finite groups with exponent q via their power graphs
Aditya Singh, Anmol chugh, Yogendra Singh, Anand Kumar Tiwari
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 ∈ G,\ u ≠ v,\ u ∈ v \ or\ v ∈ u \, where x 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 G3n. We further show that, among all the symmetric and alternating groups, only S3 and A4 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.
Create a lesson
Related papers
Simple Cayley permutations
Giulio Cerbai, Anders Claesson
Transfer of difference structures: a new semidirect product framework
Sophie Huczynska, Struan McCartney, Carys Williams
Connected Mutual-Visibility in Graphs
Tonny K B, Shikhi M
Decomposing Gorenstein polytopes of large index
Johannes Knupfer, Benjamin Nill
A non-trivial bound for 3AP-intersecting families
Peter Keevash
Solution to a conjecture on integral uniform hypercycles
Joyentanuj Das, Iswar Mahato