Abstract

The co-prime order graph of a group $$G$$ is the graph with vertex set $$G$$, and two distinct elements $$x,y\in G$$ are adjacent if gcd$$(o(x),o(y))$$ is either $$1$$ or a prime, where $$o(x)$$ and $$o(y)$$ are the orders of $$x$$ and $$y$$, respectively. In this paper, we characterize finite groups whose co-prime order graphs are complete and classify finite groups whose co-prime order graphs are planar, which generalizes some results by Banerjee [3]. We also compute the vertex-connectivity of the co-prime order graph of a cyclic group, a dihedral group and a generalized quaternion group, which answers a question by Banerjee [3].

Full Text
Paper version not known

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 call

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.