Collapsed adjacency diagrams and matrices of commuting graph, 𝒞 (G, X ) for some symmetric groups, Sym(n)

In this paper, the use of collapsed adjacency diagrams and collapsed adjacency matrices on the commuting graph 𝒞 (G, X ) is discussed. Here, we demonstrate the concepts on the symmetric group of degree n = 3r, Sym(n) = Sym(3r) where r, the number of 3-cycles in the group element t, is either 3 or 4.