A group sum inequality and its application to power graphs.

From MaRDI portal
Publication:2933690

DOI10.1017/S0004972714000434zbMATH Open1306.20025arXiv1311.2983OpenAlexW3099618532MaRDI QIDQ2933690FDOQ2933690


Authors: Brian Curtin, G. R. Pourgholi Edit this on Wikidata


Publication date: 5 December 2014

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Abstract: Let G be a finite group of order n, and let Cn be the cyclic group of order n. We show that sumginCnphi(mathrmo(g))geqsumginGphi(mathrmo(g)), with equality if and only if G is isomorphic to Cn. 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.


Full work available at URL: https://arxiv.org/abs/1311.2983




Recommendations




Cites Work


Cited In (5)





This page was built for publication: A group sum inequality and its application to power graphs.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2933690)