Abstract
ABSTRACT The power graph of a group Ω is a graph, whose node set is Ω and two distinct elements are adjacent if and only if one is an integral power of the other. A metric dimension of a graph Γ, denoted by ψ(Γ) is the minimum cardinality of the resolving set of Γ. In this context, we study distant properties and detour distant properties such as closure, interior, distance degree sequence and eccentric subgraphs of the power graphs of certain finite non-abelian groups. As a consequence, we figure out the metric dimension and resolving polynomial of power graphs for dihedral and generalized quaternion groups by using neighbourhood and twin sets.
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.
