On the number of edges of cyclic subgroup graphs of finite groups

Abstract

In this note, we show that among finite nilpotent groups of a given order or finite groups of a given odd order, the cyclic group of that order has the minimum number of edges in its cyclic subgroup graph. We also conjecture that this holds for arbitrary finite groups.

arXiv commentTo appear in Arch. Math