The Engel graph of a finite group

DOI10.1515/FORUM-2022-0070MaRDI QIDQ2679199zbMATH OpenOpenAlexFDO

Authors Eloisa Detomi, Andrea Lucchini, Daniele Nemmi

Publication date 19 January 2023

Published in Forum Mathematicum (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

commuting graphEngel word

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Arithmetic and combinatorial problems involving abstract finite groups (20D60)

Review text

Let \(G\) be a finite group. The commuting graph of \(G\) has as vertices the non-central elements of \(G\) and two distinct vertices are adjacent if and only if they commute in \(G\). The notion was introduced by \textit{R. Brauer} and \textit{K. A. Fowler} in their seminal paper [Ann. Math. (2) 62, 565--583 (1955; Zbl 0067.01004)] showing that only finitely many groups of even order can have a prescribed centralizer. In this work, the authors, as a generalization of the commuting graph, introduce the concept of Engel graph, that is the directed graph \(\Gamma(G)\), whose vertices are the non-hypercentral elements of \(G\) and where there is an edge \(x \mapsto y\) if and only if \([x, _{n}\! y] = 1\) for some \(n \in \mathbb{N}\). The main results are that \(\Gamma(G)\) is always weakly connected and is strongly connected if \(G/Z_{\infty}(G)\) is neither Frobenius nor almost simple. Another interesting result is that if \(G\) is soluble and \(G/Z_{\infty}(G)\) is not a Frobenius group, then \(\operatorname{diam}\Gamma(G) \leq 4\). Furthermore, there exists a soluble group \(G\) such that \(\operatorname{diam}\Gamma(G) = 4\).

Recommendations

• The commuting graph of a soluble group.
• On bounding the diameter of the commuting graph of a group.
• EXTENDING RESULTS OF MORGAN AND PARKER ABOUT COMMUTING GRAPHS
• The diameter of the commuting graph of a finite group with trivial centre.
• g-central graph of a group
• On graphs related to conjugacy classes of groups
• On the Diameter of a Graph Related to Conjugacy Classes of Groups
• The center graph of a group.
• Commuting graph of CA−groups
• On the relation between the non-commuting graph and the prime graph.

Cites work

• A correction to the 41-structure of the Monster, a construction of a new maximal subgroup \(L_2(41)\) and a new Moonshine phenomenon.
• Anisotropic groups of type A_n and the commuting graph of finite simple groups.
• scientific article; zbMATH DE number 3906699 (Why is no real title available?)
• scientific article; zbMATH DE number 3749242 (Why is no real title available?)
• scientific article; zbMATH DE number 3758571 (Why is no real title available?)
• Non-nilpotent graph of a group.
• On groups of even order
• ON THE COMMUTING GRAPH ASSOCIATED WITH THE SYMMETRIC AND ALTERNATING GROUPS
• On the soluble graph of a finite group
• Prime graph components of finite groups
• The commuting graph of a soluble group.
• The diameter of the commuting graph of a finite group with trivial centre.
• There is no upper bound for the diameter of the commuting graph of a finite group
• Thompson-like characterizations of the solvable radical.

Cited in

(7)

• Engel graph associated with a group.
• On the strong connectivity of the 2-Engel graphs of almost simple groups
• The Engel graph of a finite group
• The connectivity of the normalizing and permuting graph of a finite soluble group
• On the diameter of Engel graphs
• Minkowski \(\mathrm{t}\)-graph and Kendall \(\tau\)-graph of the symmetric group
• The Engel graph of almost simple groups

Describes a project that uses

Uses Software

• GAP

This page was built for publication: The Engel graph of a finite group

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