The generating graph of finite soluble groups. (Q375497): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 4 users not shown) | |||
Property / 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. | |||
Property / 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. / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Ana Martínez-Pastor / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 20D10 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C25 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 20F05 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6221316 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
finite groups | |||
Property / zbMATH Keywords: finite groups / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
soluble groups | |||
Property / zbMATH Keywords: soluble groups / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
generating graphs | |||
Property / zbMATH Keywords: generating graphs / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
2-generator groups | |||
Property / zbMATH Keywords: 2-generator groups / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
connected graphs | |||
Property / zbMATH Keywords: connected graphs / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s11856-012-0190-1 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2061434937 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Classes of Finite Groups / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Hamiltonian cycles in the generating graphs of finite groups / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Sets of elements that pairwise generate a linear group / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The generating graph of some monolithic groups. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The non-isolated vertices in the generating graph of a direct powers of simple groups. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Crowns and factorization of the probabilistic zeta function of a finite group. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Zu einem von B. H. und H. Neumann gestellten Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Pre-Frattini groups. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Ring elements as sums of units. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The X-Dirichlet polynomial of a finite group / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On finite simple groups and Kneser graphs. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the clique number of the generating graph of a finite group / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 00:32, 7 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The generating graph of finite soluble groups. |
scientific article |
Statements
The generating graph of finite soluble groups. (English)
0 references
31 October 2013
0 references
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.
0 references
finite groups
0 references
soluble groups
0 references
generating graphs
0 references
2-generator groups
0 references
connected graphs
0 references