Index graphs of finite permutation groups

Haval Mohammed Salih


Let G be a subgroup of Sn. For x ∈ G, the index of x in G is denoted by ind x is the minimal number of 2-cycles needed to express x as a product. In this paper, we define a new kind of graph on G, namely the index graph and denoted by Γind(G). Its vertex set the set of all conjugacy classes of G and two distinct vertices x ∈ Cx and y ∈ Cy are adjacent if Gcd(ind x, ind y) 6 ≠ 1. We study some properties of this graph for the symmetric groups Sn, the alternating group An, the cyclic group Cn, the dihedral group D2n and the generalized quaternain group Q4n. In particular, we are interested in the connectedness of them.


Finite Permutation Group, Index Graph, Connectedness

Full Text:




M. B. David, Elementary Number Theory, The united stated of America, (1980).

A. Erfanian and B. Tolue, Conjugate graphs of finite groups, Discrete Mathematics, Algorithms and Applications, 4, no. 2, (2012) 1250035.

G. James, M. W. Liebeck, and M. Liebeck, Representations and characters of groups. Cambridge University Press, (2001).

A. G. Joseph, Contemporary Abstract Algebra. Richard Stratton Senior Sponsoring Editor: Molly Taylor, (2010).

M. G. Neubauer, On solvable monodromy groups of fixed genus. Thesis (Ph.D.)–University of Southern California, (1989).

H. M. M. Salih, S. M. S. Omer, Structure of intersection graphs, Indonesian Journal of Combinatorics, 5, no. 2, (2021) 102–109.

Tong-Viet, P. Hung, Finite groups whose prime graphs are regular. Journal of Algebra, 397, (2014) 18-31.

R. J. Wilson, Introduction to graph theory. Pearson Education India, (1979).


  • There are currently no refbacks.

ISSN: 2541-2205

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

View IJC Stats