Abstract
ABSTRACT The commuting graph of a finite group is the undirected graph whose vertex set is the set of all elements of this group, and two distinct vertices are adjacent if they commute. In this paper, we characterize the strong metric dimension of the commuting graph of a finite group and give upper and lower bounds for the metric dimension of the commuting graph of a finite group. As applications, we compute the metric and strong metric dimension of the commuting graph of a dihedral group, a generalized quaternion group and a semidihedral group.
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.
