On a new graph defined on the order of elements of a finite group

From MaRDI portal
Publication:6328709

arXiv1911.02763MaRDI QIDQ6328709FDOQ6328709


Authors: Subarsha Banerjee Edit this on Wikidata


Publication date: 7 November 2019

Abstract: In this paper, a new graph structure called the extit{coprime order graph} of a finite group G denoted by Theta(G) has been introduced. The extit{coprime graph} of a finite group introduced by Ma, Wei, and Yang [ extit{The coprime graph of a group. International Journal of Group Theory, 3(3), pp.13-23.}] is a subgraph of the extit{coprime order graph} introduced in this paper. The vertex set of Theta(G) is G, and any two vertices x,y in Theta(G) are adjacent if and only if gcd(o(x),o(y)) is equal to 1 or a prime number. We study how the graph properties of Theta(G) and group properties of G are related among themselves. We provide a necessary and sufficient condition for Theta(G) to be Eulerian for any finite group G. We also study Theta(G) for certain finite groups like mathbbZn and mboxDn and derive conditions when it is connected, complete, planar, and Hamiltonian for various ninmathbbN. We also study the vertex connectivity of Theta(mathbbZn) for various ninmathbbN. Finally, we have computed the signless Laplacian spectrum of Theta(G) when G=mathbbZn and G=mboxDn for ninpq,pm where p,q are distinct primes and minmathbbN.













This page was built for publication: On a new graph defined on the order of elements of a finite group

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6328709)