Abstract
Given a connected graph Δ, a group G can be constructed in such a way that Δ is often isomorphic to a subgraph of the commuting graph KG(Δ) of G. We show that, with one exception, KG(Δ) is connected, and in this latter case its diameter is at most that of Δ. If Δ is a path of length n>2, then diam(KG(Δ))=n.
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 callSimilar Papers
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.
