The Complexity of Power Graphs Associated With Finite Groups

zbMath1504.05128arXiv1806.02122MaRDI QIDQ3120654

No author found.

Publication date: 5 March 2019

Full work available at URL: https://arxiv.org/abs/1806.02122

zbMATH Keywords

complexityspanning treegrouppower graph

Mathematics Subject Classification ID

Arithmetic and combinatorial problems involving abstract finite groups (20D60) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (4)

Some properties of various graphs associated with finite groups ⋮ A combinatorial characterization of finite groups of prime exponent ⋮ The complexity of specific commuting graphs ⋮ On the minimum degree of power graphs of finite nilpotent groups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spectra of graphs
• Cayley graphs as classifiers for data mining: the influence of asymmetries
• Laplacian graph eigenvectors
• Undirected power graphs of semigroups
• Certain properties of the power graph associated with a finite group
• The power graph of a finite group, II
• The number of spanning trees of power graphs associated with specific groups and some applications
• A Combinatorial Proof of the All Minors Matrix Tree Theorem
• A note on the power graph of a finite group
• Power graphs: A survey
• Endliche Gruppen I

This page was built for publication: The Complexity of Power Graphs Associated With Finite Groups