Abstract
The inclusion graph of a finite group [Formula: see text], written as [Formula: see text], is defined to be an undirected graph whose vertices are all nontrivial subgroups of [Formula: see text], and two distinct vertices [Formula: see text], [Formula: see text] are adjacent if and only if either [Formula: see text] or [Formula: see text]. For a graph [Formula: see text] with vertex set [Formula: see text], a set of vertices [Formula: see text] is called a fixing set of [Formula: see text] if the only automorphism of [Formula: see text] that fixes every element in [Formula: see text] is the identity. The fixing number of [Formula: see text] is the smallest size of a fixing set of [Formula: see text]. In this paper, we determine the finite nilpotent groups whose inclusion graphs are planar. Moreover, using the technique of characteristic matrices, we characterize the fixing sets and give the exact value on the fixing number of the inclusion graphs for finite cyclic groups.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
