Ukrainian Mathematical Journal

, Volume 66, Issue 5, pp 732–742 | Cite as

On the Diameters of Commuting Graphs of Permutational Wreath Products

  • Yu. Yu. Leshchenko

Let G be a group and let Z(G) be the center of G. The commuting graph of the group G is an undirected graph Γ(G) with the vertex set G \ Z(G) such that two vertices x, y are adjacent if and only if xy = yx. We study the commuting graphs of permutational wreath products H Open image in new window G, where G is a transitive permutation group acting on X (the top group of the wreath product) and (H, Y) is an Abelian permutation group acting on Y.


Maximal Length Symmetric Group Permutation Group Cayley Graph Wreath Product 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    A. Iranmanesh and A. Jafarzadeh, “On the commuting graph associated with the symmetric and alternating groups,” J. Algebra Appl., 7, No. 1, 129–146 (2008).CrossRefzbMATHMathSciNetGoogle Scholar
  2. 2.
    M. Giudici and C. Parker, “There is no upper bound for the diameter of the commuting graph of a finite group,” arXiv 2012 (
  3. 3.
    S. Akbari, A. Mohammadian, H. Radjavi, and P. Raja, “On the diameters of commuting graphs,” Linear Algebra Appl., 418, No. 1, 161–176 (2006).CrossRefzbMATHMathSciNetGoogle Scholar
  4. 4.
    A. R. Moghaddamfar, “About noncommuting graphs,” Sib. Mat. Zh., 47, No. 5, 911–914 (2006).CrossRefMathSciNetGoogle Scholar
  5. 5.
    A. Abdollahi, S. Akbari, H. Dorbidi, and H. Shahverdi, “Commutativity pattern of finite non-Abelian p-groups determines their orders,” Comm. Algebra, 41, No. 2, 451–461 (2013).CrossRefzbMATHMathSciNetGoogle Scholar
  6. 6.
    G. L. Morgan and C. W. Parker, “The diameter of the commuting graph of a finite group with trivial centre,” arXiv 2013 (
  7. 7.
    M. Guidici and A. Pope, “On bounding the diameter of the commuting graph of a group,” arXiv 2012 (
  8. 8.
    L. Kaloujnine, “La structure des p-groupes de Sylow des groupes symetriques finis,” Ann. Sci. l’Ecole Norm. Super., 65, 239–276 (1948).zbMATHMathSciNetGoogle Scholar
  9. 9.
    A. S. Oliynyk and V. I. Sushchanskii, “The groups of ZC-automaton transformations,” Sib. Mat. Zh., 51, No. 5, 879–891 (2010).CrossRefzbMATHGoogle Scholar
  10. 10.
    P. M. Neumann, “On the structure of standard wreath products of groups,” Math. Zeitschr., 84, 343–373 (1964).CrossRefzbMATHGoogle Scholar
  11. 11.
    I. M. Isaacs, Finite Group Theory [Graduate Studies in Mathematics, Vol. 92], AMS, Providence, RI (2008).Google Scholar
  12. 12.
    Yu. Yu. Leshchenko and L. V. Zoria, “On diameters estimations of the commuting graphs of Sylow p-subgroups of the symmetric groups,” Carpat. Math. Publ., 5, No. 1, 70–78 (2013).CrossRefGoogle Scholar
  13. 13.
    The GAP Group, GAP—Groups, Algorithms, and Programming, Version 4.6.3 (2013) (
  14. 14.
    V. I. Sushchansky and V. S. Sikora, Operations on the Permutation Groups [in Ukrainian], Chernivtsi, Ruta (2003).Google Scholar
  15. 15.
    A. J. Slupik and V. I. Sushchansky, “Minimal generating sets and Cayley graphs of Sylow p-subgroups of finite symmetric groups,” Algebra Discr. Math., 4, 167–184 (2009).MathSciNetGoogle Scholar
  16. 16.
    A. J. Weir, “Sylow p-subgroups of the classical groups over finite fields with characteristic prime to p,Proc. Amer. Math. Soc., 6, No. 4, 529–533 (1955).zbMATHMathSciNetGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2014

Authors and Affiliations

  • Yu. Yu. Leshchenko
    • 1
  1. 1.Institute of Physics, Mathematics, and Computer ScienceCherkasy National UniversityCherkasyUkraine

Personalised recommendations