Finite groups with planar generating graph
From MaRDI portal
Publication:5109062
Abstract: Given a finite group , the generating graph of has as vertices the non-identity elements of and two vertices are adjacent if and only if they are distinct and generate as group elements. Let be a 2-generated finite group. We prove that is planar if and only if is isomorphic to one of the following groups:
Recommendations
Cites work
- Crowns and factorization of the probabilistic zeta function of a finite group.
- Die Eulersche Funktion endlicher auflösbarer Gruppen
- Graph theory
- Hamiltonian cycles in the generating graphs of finite groups.
- Probabilistic generation of finite groups with a unique minimal normal subgroup.
- Probabilistic generation of finite simple groups
- Probabilistic generation of finite simple groups. II.
- Zu einem von B. H. und H. Neumann gestellten Problem
Cited in
(9)- Generating graphs of finite dihedral groups
- scientific article; zbMATH DE number 5049072 (Why is no real title available?)
- Finite groups with star-free noncyclic graphs
- The non‐F graph of a finite group
- Planarity and fixing number of inclusion graph of a nilpotent group
- Planar infinite groups.
- Genus, thickness and crossing number of graphs encoding the generating properties of finite groups
- Finite groups whose intersection power graphs are toroidal and projective-planar
- The independence graph of a finite group
This page was built for publication: Finite groups with planar generating graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5109062)