Abstract
The non-commuting graph associated to a group has non-central elements of the graph as vertices and two elements [Formula: see text] and [Formula: see text] do not form an edge if and only if [Formula: see text]. In this paper, we consider non-commuting graphs associated to dihedral and semidihedral groups. We investigate their metric properties such as center, periphery, eccentric graph, closure and interior. We also perform various types of metric identifications on these graphs. Moreover, we generate metric and metric-degree polynomials of these graphs.
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 callMore From: International Journal of Foundations of Computer Science
Disclaimer: 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.
