2020Journal of Mathematics and Computer ScienceOpen access

Co-prime order graphs of finite Abelian groups and dihedral groups

Amit Sehgal, Manjeet Manjeet, Dalip Singh

Open full text 11 citations

Abstract

The 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 derive a precise formula to count the vertex's degree 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 \(\Theta (G)\) when G is a finite Abelian p-group, \({\mathbb{Z}_p}^t \times {\mathbb{Z}_q}^s\) or a dihedral group \(D_{p^n}\).

Open-access reader

About this research paper

What this paper is about

The 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 derive a precise formula to count the vertex's degree 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 \(\Theta (G)\) when G is a finite Abelian p-group, \({\mathbb{Z}_p}^t \times {\mathbb{Z}_q}^s\) or a dihedral group \(D_{p^n}\).

Why it matters

OpenAlex reports 11 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The 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 derive a precise formula to count the vertex's degree 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 \(\Theta (G)\) when G is a finite Abelian p-group, \({\mathbb{Z}_p}^t \times {\mathbb{Z}_q}^s\) or a dihedral group \(D_{p^n}\).

Key concepts: Dihedral group, Combinatorics, Mathematics, Abelian group, p-group, Cyclic group, Vertex (graph theory), Non-abelian group

Related papers

Back to paper searchBrowse research topicsOriginal source
Co-prime order graphs of finite Abelian groups and dihedral groups — Research Paper | ScholarLens