Co-Prime Order graph of a finite abelian Group and Dihedral Group
arXiv:2003.09850 · doi:10.22436/jmcs.023.03.03
Abstract
The \textbf{Co-Prime Order Graph} of a given finite group is a simple undirected graph whose vertex set is the group itself, and any two vertexes x,y in are adjacent if and only if 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 .We also investigate the Laplacian spectrum of the Co-Prime Order Graph when G is finite abelian p-group, or Dihedral group . Key Words and Phrases: Co-Prime Order graph,finite abelian group,Dihedral group, Laplacian spectrum.