ON THE COMMUTING GRAPH ASSOCIATED WITH THE SYMMETRIC AND ALTERNATING GROUPS

By Ali Iranmanesh, A. Jafarzadeh. 2008

92 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Discrete Mathematics and Combinatorics, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/a1c9cff8e84bb393c07a49fc6ba79c929c51ac00

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

1. Peter J. Cameron
2. G. L. Morgan
3. Chris Parker

In Discrete Mathematics and Combinatorics

1. Peter J. Cameron
2. G. L. Morgan
3. Chris Parker
4. Leandro Vendramin

In Electrical and Electronic Engineering

1. Peter J. Cameron
2. G. L. Morgan
3. Chris Parker

Citations in the corpus

• The diameter of the commuting graph of a finite group with trivial centre (2013, methodology): “In the case that Γ is connected, we could use [17] to get that the diameter is at most 5.”
• The commuting graph of a soluble group (2012, background): “In [8] Iranmanesh and Jafarzadeh demonstrate that the commuting graph of Sym(n) and Alt(n) is either disconnected or has diameter at most 5 and, in the same article, they conjecture that there is an absolute upper bound for the diameter of a connected commuting graph of a non-abelian finite group.”
• Graphs defined on groups (2021, background): “After a lot of preliminary work, much of it on specific groups, summarised in the introduction to [52], Iranmanesh and Jafarzadeh [67] conjectured that there is an absolute upper bound on the diameter of any connected component of the induced subgraph on G\Z(G) of the commuting graph of G.”