The generating graph of finite soluble groups.

DOI10.1007/S11856-012-0190-1MaRDI QIDQ375497zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

2-generator groupsconnected graphsfinite groupsgenerating graphssoluble groups

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Finite solvable groups, theory of formations, Schunck classes, Fitting classes, (pi)-length, ranks (20D10) Generators, relations, and presentations of groups (20F05)

Review text

In recent years several authors have investigated the generating graph of a finite group. Given a finite group \(G\), the generating graph, denoted by \(\Gamma(G)\), is the graph whose vertices are the non-identity elements of \(G\) and two distinct vertices are connected by an edge if and only if they generate \(G\). Clearly, if \(G\) is not \(2\)-generated, then all the vertices in this graph are isolated, that is, there are no edges. So, it is natural to consider the case when \(G\) is \(2\)-generated. For such a group, let \(\Delta(G)\) be the subgraph of \(\Gamma(G)\) obtained by removing the isolated vertices. The main result of the paper under review states that if \(G\) is soluble, and \(2\)-generated, then \(\Delta(G)\) is connected. The key tool for the proof is the notion of crown, introduced by \textit{W. Gaschütz} [Arch. Math. 13, 418-426 (1962; Zbl 0109.01403)]. The authors point out that they obtained an analogous result [in J. Algebr. Comb. 37, No. 2, 249-263 (2013; Zbl 1276.20026)] for the case when \(G\) is a direct product of finite non-Abelian simple groups. Also, they observe that no example is known of a group \(G\) for which \(\Delta(G)\) is not connected.

Recommendations

• The diameter of the generating graph of a finite soluble group
• Forbidden subgraphs in generating graphs of finite groups
• On the connectivity of the non-generating graph
• Connectivity of generating graphs of nilpotent groups
• The independence graph of a finite group

Cites work

• Classes of Finite Groups
• Crowns and factorization of the probabilistic zeta function of a finite group.
• Hamiltonian cycles in the generating graphs of finite groups.
• On finite simple groups and Kneser graphs.
• On the clique number of the generating graph of a finite group
• Pre-Frattini groups.
• Ring elements as sums of units.
• Sets of elements that pairwise generate a linear group
• The generating graph of some monolithic groups.
• The non-isolated vertices in the generating graph of a direct powers of simple groups.
• The X-Dirichlet polynomial of a finite group
• Zu einem von B. H. und H. Neumann gestellten Problem

Cited in

(28)

• The non-isolated vertices in the generating graph of a direct powers of simple groups.
• Connectivity of generating graphs of nilpotent groups
• Forbidden subgraphs in generating graphs of finite groups
• On the connectivity of the non-generating graph
• The generating graph of a profinite group
• The independence graph of a finite group
• On a special quotient of the generating graph of a finite group
• The diameter of the generating graph of a finite soluble group
• On the Soluble Graph of a Finite Simple Group
• The swap graph of the finite soluble groups
• The graph of the generating \(d\)-tuples of a finite soluble group and the swap conjecture.
• The graph of generating sets of an abelian group
• Generating sets of finite groups
• The complement of proper power graphs of finite groups
• On the generating graph of a simple group
• THE GENERATING GRAPH OF INFINITE ABELIAN GROUPS
• CONNECTED COMPONENTS IN THE INVARIABLY GENERATING GRAPH OF A FINITE GROUP
• The virtually generating graph of a profinite group
• Graphs encoding the generating properties of a finite group
• The solubility graph associated with a finite 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
• On the connectivity of the generating and rank graphs of finite groups
• Generating graphs of some solvable groups
• Abelian supplements in almost simple groups
• Finite solvable groups whose character graphs are trees.
• Finite soluble groups satisfying the swap conjecture.

This page was built for publication: The generating graph of finite soluble groups.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q375497)