Superpower graphs of finite groups (Q6988947)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8035298
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Superpower graphs of finite groups |
scientific article; zbMATH DE number 8035298 |
Statements
Superpower graphs of finite groups (English)
0 references
30 April 2025
0 references
For a finite group \(G\), the superpower graph \(S(G)\) of \(G\) is an undirected simple graph with vertex set \(G\) and two vertices are adjacent in \(S(G)\) if and only if the order of one divides the order of the other in \(G\). This paper provides tight bounds for the vertex connectivity and discusses Hamiltonian-like properties of the superpower graph of finite non-abelian groups having an element of exponent order. The authors also give some general results about superpower graphs and their relation to other graphs.
0 references
superpower graph
0 references
power graph
0 references
Hamiltonian cycle
0 references
simple group
0 references
vertex connectivity
0 references
0 references
