The diameter of the commuting graph of a finite group with trivial centre. (Q2438382): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 6 users not shown)
Property / reviewed by
 
Property / reviewed by: Anatoli Kondrat'ev / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Anatoli Kondrat'ev / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Magma / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2019945630 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1301.2341 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the diameters of commuting graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The classification of the finite simple groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Involutions in Chevalley groups over fields of even order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Commuting Involution Graphs in Special Linear Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Commuting involution graphs for sporadic simple groups. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transitive Gruppen gerader Ordnung, in denen jede Involution genau einen Punkt fest läßt / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Magma algebra system. I: The user language / rank
 
Normal rank
Property / cites work
 
Property / cites work: On groups of even order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-Abelian Sylow subgroups of finite groups of even order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3684278 / rank
 
Normal rank
Property / cites work
 
Property / cites work: There is no upper bound for the diameter of the commuting graph of a finite group / rank
 
Normal rank
Property / cites work
 
Property / cites work: The diameters of commuting graphs of linear groups and matrix rings over the integers modulo m / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5577154 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4375273 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Endliche Gruppen I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prime graph components of the simple groups of Lie type over the field of even characteristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE COMMUTING GRAPH ASSOCIATED WITH THE SYMMETRIC AND ALTERNATING GROUPS / rank
 
Normal rank
Property / cites work
 
Property / cites work: PRIME GRAPH COMPONENTS OF FINITE SIMPLE GROUPS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Addendum to ``Prime graph components of finite almost simple groups''. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The commuting graph of a soluble group / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anisotropic groups of type \(A_n\) and the commuting graph of finite simple groups. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple groups are characterized by their non-commuting graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4535086 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Ree's Series of Simple Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prime graph components of finite groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognition of finite groups by the prime graph / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:35, 7 July 2024

scientific article
Language Label Description Also known as
English
The diameter of the commuting graph of a finite group with trivial centre.
scientific article

    Statements

    The diameter of the commuting graph of a finite group with trivial centre. (English)
    0 references
    0 references
    0 references
    11 March 2014
    0 references
    The commuting graph \(\Gamma(G)\) of a group \(G\) is the graph which has vertices the non-central elements of \(G\) and two distinct vertices of \(\Gamma(G)\) are adjacent if and only if they commute in \(G\). \textit{A. Iranmanesh} and \textit{A. Jafarzadeh} [J. Algebra Appl. 7, No. 1, 129-146 (2008; Zbl 1151.20013)] demonstrated that the commuting graphs of the finite symmetric and alternating groups are either disconnected or have diameter at most 5 and conjectured that there is an absolute upper bound for the diameter of a connected commuting graph of a non-Abelian finite group. \textit{M. Giudichi} and \textit{C. Parker} [J. Comb. Theory, Ser. A 120, No. 7, 1600-1603 (2013)] have shown that this conjecture is incorrect by constructing an infinite family of special 2-groups with commuting graphs of increasing diameter. In this paper, the authors prove that the connected components of the commuting graph of a finite group with trivial centre have diameter at most 10. Various special kinds of finite groups with bounded diameter commuting graph were investigated by \textit{Y. Segev} and \textit{G. M. Seitz} [Pac. J. Math. 202, No. 1, 125-225 (2002; Zbl 1058.20015)], Iranmanesh and Jafarzadeh [loc. cit.], \textit{T. J. Woodkock} [Commuting graphs of finite groups. PhD thesis, Univ. Virginia (2010)], \textit{M. Giudici} and \textit{A. Pope} [Australas. J. Comb. 48, 221-230 (2010; Zbl 1232.05114); J. Group Theory 17, No. 1, 131-149 (2014)], the second author [Bull. Lond. Math. Soc. 45, No. 4, 839-848 (2013; Zbl 1278.20017)].
    0 references
    finite groups
    0 references
    simple groups
    0 references
    commuting graphs
    0 references
    diameters
    0 references
    connected graphs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references