The generating graph of finite soluble groups.
From MaRDI portal
Publication:375497
DOI10.1007/s11856-012-0190-1zbMath1300.20021OpenAlexW2061434937MaRDI QIDQ375497
Eleonora Crestani, Andrea Lucchini
Publication date: 31 October 2013
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11856-012-0190-1
Finite solvable groups, theory of formations, Schunck classes, Fitting classes, (pi)-length, ranks (20D10) Generators, relations, and presentations of groups (20F05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)
Related Items (13)
On the connectivity of the non-generating graph ⋮ Generating sets of finite groups ⋮ The diameter of the generating graph of a finite soluble group ⋮ The non‐F graph of a finite group ⋮ Generating graphs of finite dihedral groups ⋮ Semiregularity and connectivity of the non-𝔉 graph of a finite group ⋮ The generating graph of a profinite group ⋮ Finite soluble groups satisfying the swap conjecture. ⋮ Connectivity of generating graphs of nilpotent groups ⋮ The complement of proper power graphs of finite groups ⋮ THE GENERATING GRAPH OF INFINITE ABELIAN GROUPS ⋮ Forbidden subgraphs in generating graphs of finite groups ⋮ CONNECTED COMPONENTS IN THE INVARIABLY GENERATING GRAPH OF A FINITE GROUP
Cites Work
- The generating graph of some monolithic groups.
- On finite simple groups and Kneser graphs.
- Ring elements as sums of units.
- Pre-Frattini groups.
- Crowns and factorization of the probabilistic zeta function of a finite group.
- The non-isolated vertices in the generating graph of a direct powers of simple groups.
- Sets of elements that pairwise generate a linear group
- On the clique number of the generating graph of a finite group
- Zu einem von B. H. und H. Neumann gestellten Problem
- Hamiltonian cycles in the generating graphs of finite groups
- The X-Dirichlet polynomial of a finite group
- Classes of Finite Groups
This page was built for publication: The generating graph of finite soluble groups.