English

Co-Prime Order graph of a finite abelian Group and Dihedral Group

Group Theory 2021-06-17 v2 Combinatorics

Abstract

The \textbf{Co-Prime Order Graph} Θ(G)\Theta (G) of a given finite group is a simple undirected graph whose vertex set is the group GG itself, and any two vertexes x,y in Θ(G)\Theta (G) are adjacent if and only if gcd(o(x),o(y))=1gcd(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 DnD_n.We also investigate the Laplacian spectrum of the Co-Prime Order Graph Θ(G)\Theta (G) when G is finite abelian p-group, Zpt×Zqs{\mathbb{Z}_p}^t \times {\mathbb{Z}_q}^s or Dihedral group DpnD_{p^n}. Key Words and Phrases: Co-Prime Order graph,finite abelian group,Dihedral group, Laplacian spectrum.

Keywords

Cite

@article{arxiv.2003.09850,
  title  = {Co-Prime Order graph of a finite abelian Group and Dihedral Group},
  author = {Amit Sehgal and Manjeet and Dalip Singh},
  journal= {arXiv preprint arXiv:2003.09850},
  year   = {2021}
}