[1] M. Artin. Algebra. Pearson, 2nd edition, 2011.
[2] G. E. Andrews. The Theory of Partitions. Cambridge University Press, 1998.
[3] W. Burnside. Theory of Groups of Finite Order. Cambridge University Press, 2nd edition, 1911.
[4] P. J. Cameron. Oligomorphic permutation groups. In Perspectives in Mathematical Sciences II, 8 (1990), 37–61.
[5] P. J. Cameron. Notes on Counting: An Introduction to Enumerative Combinatorics, 26 of Cambridge Texts in Applied Mathematics. Cambridge University Press, 2017.
[6] P. Diaconis, J. Fulman, and R. Guralnick. On fixed points of permutations. Journal of Algebraic Combinatorics, 28(1) (2008), 189–218.
[7] D. F. Holt, B. Eick, and E. A. O’Brien. Handbook of Computational Group Theory. Chapman & Hall/CRC, 2005.
[8] D. S Kumar , P. S Ranjini , H. M R and L. V,. Computation of NM-polnomial and topological indices for cycle related graphs. Journal of Hyperstructures. 14 2 (2025), 242–255, doi: 10.22098/jhs.2025.17644.1100
[9] R. C. Lyndon and P. E. Schupp. Combinatorial Group Theory. Springer, 2001.
[10] G.-C. Rota. The number of partitions of a set. The American Mathematical Monthly, 71(5), (1964), 498–504.
[11] J. J. Rotman. Advanced Modern Algebra. American Mathematical Society, 2nd edition, 2010.
[12] R. P. Stanley. Enumerative Combinatorics, volume 1. Cambridge University Press, 2nd edition, 2011.