Abstract

The \textbf{Co-Prime Order Graph} $\Theta (G)$ of a given finite group is a simple undirected graph whose vertex set is the group $G$ itself, and any two vertexes x,y in $\Theta (G)$ are adjacent if and only if $gcd(o(x),o(y))=1$ or prime. In this paper, we find a precise formula to count the degree of a vertex in the Co-Prime Order graph of a finite abelian group or Dihedral group $D_n$.We also investigate the Laplacian spectrum of the Co-Prime Order Graph $\Theta (G)$ when G is finite abelian p-group, ${\mathbb{Z}_p}^t \times {\mathbb{Z}_q}^s$ or Dihedral group $D_{p^n}$. Key Words and Phrases: Co-Prime Order graph,finite abelian group,Dihedral group, Laplacian spectrum.

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.