A group sum inequality and its application to power graphs

B. Curtin, G. R. Pourgholi


Let \(G\) be a finite group of order \(n\), and let \(C_n\) be the cyclic group of order \(n\). For \(g∈G\), let \(o(g)\) denote the order of \(g\). Let \(ϕ\) denote the Euler totient function. We show that \(\sum_{g \in C_n} \phi(o(g))\geq \sum_{g \in G} \phi(o(g))\), with equality if and only if \(G\) is isomorphic to \(C_n\). As an application, we show that among all finite groups of a given order, the cyclic group of that order has the maximum number of undirected edges in its directed power graph.




Cyclic groups, Euler totient, Sylow subgroups

Remember, for most actions you have to record/upload into OJS
and then inform the editor/author via clicking on an email icon or Completion button.
Bulletin of the Aust. Math. Soc., copyright Australian Mathematical Publishing Association Inc.