

























The \textbf{Co-Prime Order Graph} $Θ(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 $Θ(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 $Θ(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.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。