Classification of Groups according to the number of end vertices in the coprime graph

2018/03/06 by Alraqad, Tariq A., Saeed., Muhammad S., Alshawarbeh, Etaf S.
#FOS: Mathematics #Group Theory (math.GR)

paper · doi:10.48550/arxiv.1803.02420

Abstract

In this paper we characterize groups according to the number of end vertices in the associated coprime graphs. An upper bound on the order of the group that depends on the number of end vertices is obtained. We also prove that 2-groups are the only groups whose coprime graphs have odd number of end vertices. Classifications of groups with small number of end vertices in the coprime graphs are given. One of the results shows that ℤ₄ and ℤ₂× ℤ₂ are the only groups whose coprime graph has exactly three end vertices.

Related

• Coprime graph of subgroups of a group
• Minimum coprime graph labelings
• Which coprime graphs are divisor graphs?
• On a new graph defined on the order of elements of a finite group
• A Census of Small Transitive Groups and Vertex-Transitive Graphs