The complexity of specific commuting graphs

DOI10.1142/S0219498822501195OpenAlexW3127142857MaRDI QIDQ5863508

A. Mahmoudifar, F. Salehzadeh, Xiaoyou Chen, Ali Reza Moghaddamfar

Publication date: 1 June 2022

Published in: Journal of Algebra and Its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0219498822501195

zbMATH Keywords

complexitysimple groupcommuting graphAC-group

Mathematics Subject Classification ID

Trees (05C05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Finite simple groups and their classification (20D05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Anisotropic groups of type \(A_n\) and the commuting graph of finite simple groups.
• On groups of even order
• On finite homomorphic images of the multiplicative group of a division algebra
• Laplacian graph eigenvectors
• Some methods for counting the spanning trees in labelled molecular graphs, examined in relation to certain fullerenes
• The Complexity of Power Graphs Associated With Finite Groups
• A NEW TYPE OF SIMPLE GROUPS OF FINITE ORDER
• ON THE GENUS OF THE COMMUTING GRAPHS OF FINITE NON-ABELIAN GROUPS
• Algebraic Graph Theory
• Spanning trees on graphs and lattices inddimensions
• Laplacian and Signless Laplacian Spectrum of Commuting Graphs of Finite Groups
• Counting Centralizers in Finite Groups
• Commuting graphs of groups and related numerical parameters
• Finite groups whose commuting graphs are integral
• Endliche Gruppen I
• On a class of doubly transitive groups
• The commuting graph of minimal nonsolvable groups