Superpower graphs of finite groups
From MaRDI portal
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.
Cites work
- A decomposition theorem for partially ordered sets
- A survey on the automorphism groups of the commuting graphs and power graphs
- A survey: Hamiltonian cycles in Cayley graphs
- An Adjacency Criterion for the Prime Graph of a Finite Simple Group
- Automorphism groups of supergraphs of the power graph of a finite group
- Cayley graphs as classifiers for data mining: the influence of asymmetries
- Criterion of unrecognizability of a finite group by its Gruenberg-Kegel graph
- Graph theory
- Hamiltonian cycles and paths in Cayley graphs and digraphs---a survey
- scientific article; zbMATH DE number 3741621 (Why is no real title available?)
- scientific article; zbMATH DE number 2031101 (Why is no real title available?)
- scientific article; zbMATH DE number 2108136 (Why is no real title available?)
- On isomorphisms of finite Cayley graphs---a survey
- Power graphs: A survey
- Recent developments on the power graph of finite groups -- a survey
- Ring constructions and applications
- Some remarks on the order supergraph of the power graph of a finite group
- Some results on the main supergraph of finite groups
- Spectrum and L-spectrum of the power graph and its main supergraph for certain finite groups
- The order supergraph of the power graph of a finite group
- The strong perfect graph theorem
- Undirected power graphs of semigroups
This page was built for publication: Superpower graphs of finite groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6988947)