A combinatorial characterization of finite groups of prime exponent

2018/05/30 by Panda, Ramesh Prasad
#05C25 #20D60 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1805.12119

Abstract

The power graph of a group G is a simple and undirected graph with vertex set G and two distinct vertices are adjacent if one is a power of the other. In this article, we characterize (non-cyclic) finite groups of prime exponent and finite elementary abelian 2-groups (of rank at least 2) in terms of their power graphs.

Related

• On the minimum cut-sets of the power graph of a finite cyclic group, II
• k-Power Graphs of Finite Groups
• Some results in a new power graphs in finite groups
• Characterizing finite nilpotent groups associated with a graph theoretic\n equality
• The degree of a vertex in the power graph of a finite abelian group