A combinatorial characterization of finite groups of prime exponent
Combinatorics
2019-03-20 v3
Abstract
The power graph of a group is a simple and undirected graph with vertex set 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 -groups (of rank at least ) in terms of their power graphs.
Keywords
Cite
@article{arxiv.1805.12119,
title = {A combinatorial characterization of finite groups of prime exponent},
author = {Ramesh Prasad Panda},
journal= {arXiv preprint arXiv:1805.12119},
year = {2019}
}