Superpower graphs of finite abelian groups
From MaRDI portal
The concept of superpower graph \(S(G)\) of a finite group \(G\) has evolved very recently. The authors investigate it and derive some results. Their result is that \(S(G)\) is Hamiltonian whenever the order of \(G\) is more than 2, and its consequences are interesting. They also raise some open problems for researchers in this area to explore further.
Cites work
- A survey on the automorphism groups of the commuting graphs and power graphs
- A survey: Hamiltonian cycles in Cayley graphs
- Automorphism groups of supergraphs of the power graph of a finite group
- Cayley graphs as classifiers for data mining: the influence of asymmetries
- Graph theory
- Hamiltonian cycles and paths in Cayley graphs and digraphs---a survey
- 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
- On the order supergraph of the power graph of a finite group
- 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
- Undirected power graphs of semigroups
This page was built for publication: Superpower graphs of finite abelian groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6886642)
