
AbstractGiven a finite group G, we denote by $$\Delta (G)$$ Δ ( G ) the graph whose vertices are the elements G and where two vertices x and y are adjacent if there exists a minimal generating set of G containing x and y. We prove that $$\Delta (G)$$ Δ ( G ) is connected and classify the groups G for which $$\Delta (G)$$ Δ ( G ) is a planar graph.
Connectivity; Generating graph; Generating sets; Planarity; Soluble groups, Group Theory (math.GR), planarity, Graphs and abstract algebra (groups, rings, fields, etc.), soluble groups, connectivity, FOS: Mathematics, generating sets, generating graph, Mathematics - Group Theory, Arithmetic and combinatorial problems involving abstract finite groups
Connectivity; Generating graph; Generating sets; Planarity; Soluble groups, Group Theory (math.GR), planarity, Graphs and abstract algebra (groups, rings, fields, etc.), soluble groups, connectivity, FOS: Mathematics, generating sets, generating graph, Mathematics - Group Theory, Arithmetic and combinatorial problems involving abstract finite groups
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 5 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
