Connectivity of generating graphs of nilpotent groups

DOI10.5802/alco.132zbMath1481.20111arXiv2002.03330OpenAlexW3036713978MaRDI QIDQ2004051

Andrea Lucchini, Scott Harper

Publication date: 14 October 2020

Published in: Algebraic Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

nilpotent groupsconnectivitygenerating graph

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Finite nilpotent groups, (p)-groups (20D15)

Related Items (4)

Dispersive stabilization for phase transitions ⋮ Transverse instability of high frequency weakly stable quasilinear boundary value problems ⋮ Forbidden subgraphs in generating graphs of finite groups ⋮ CONNECTED COMPONENTS IN THE INVARIABLY GENERATING GRAPH OF A FINITE GROUP

Cites Work

• Unnamed Item
• Unnamed Item
• The generating graph of finite soluble groups.
• Maximally edge-connected and vertex-connected graphs and digraphs: A survey
• Probabilistic generation of finite simple groups. II.
• On finite simple groups and Kneser graphs.
• Hamiltonicity of the cross product of two Hamiltonian graphs
• Probabilistic generation of finite simple groups
• On the uniform spread of almost simple symplectic and orthogonal groups
• The diameter of the generating graph of a finite soluble group
• Connectivity of Kronecker products with complete multipartite graphs
• On the clique number of the generating graph of a finite group
• Hamiltonian cycles in the generating graphs of finite groups
• Congruent Graphs and the Connectivity of Graphs
• On the uniform domination number of a finite simple group
• Some Theorems on Abstract Graphs

This page was built for publication: Connectivity of generating graphs of nilpotent groups