In this chapter, equipped with basic group theory, we examine permutation groups with the objective of realising them as automorphism groups of graphs and other combinatorial structures. Motivated by the classification problem of distance-transitive graphs,we reviewearly studies on permutation groups with specified subconstituents, particularly those involving symmetric subconstituents.