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

DOI10.22436/JMCS.023.03.03arXiv2003.09850MaRDI QIDQ6337182FDOQ6337182

Authors: Amit Sehgal, Manjeet, Dalip Singh

Publication date: 22 March 2020

Abstract: The extbf{Co-Prime Order Graph}

T h e t a (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

T h e t a (G)

are adjacent if and only if

g c d (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

T h e t a (G)

when G is finite abelian p-group,

{m a t h b b Z_{p}}^{t} i m e s {m a t h b b Z_{q}}^{s}

or Dihedral group

D_{p^{n}}

. Key Words and Phrases: Co-Prime Order graph,finite abelian group,Dihedral group, Laplacian spectrum.

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

This page was built for publication: Co-Prime Order graph of a finite abelian Group and Dihedral Group

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