A group sum inequality and its application to power graphs.

DOI10.1017/S0004972714000434MaRDI QIDQ2933690zbMATH OpenOpenAlexFDO

Authors Brian Curtin, G. R. Pourgholi

Publication date 5 December 2014

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

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

zbMATH Keywords

finite groupsSylow subgroupssets of element orderssums of element ordersEuler totient functioncyclic groupspower graphsnumbers of edges

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Arithmetic and combinatorial problems involving abstract finite groups (20D60)

Abstract: Let $G$ be a finite group of order $n$, and let $C_n$ be the cyclic group of order $n$. We show that $su{m}_{gin{C}_n}phi(mathrmo(g))geqsu{m}_{ginG}phi(mathrmo(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.

Recommendations

• The number of edges in power graph of finite groups
• The power graph of a finite group. II.
• Some properties of power graphs in finite group
• Sum of the products of the orders of two distinct elements in finite groups.
• Sums of Element Orders in Finite Groups

Cites work

• Directed graphs and combinatorial properties of semigroups
• Power graphs: A survey
• Sums of Element Orders in Finite Groups

Cited in

(5)

• Prime index elements graph of a group
• Ideal basis in constructions defined by directed graphs
• An Euler totient sum inequality
• Spectrum and L-spectrum of the power graph and its main supergraph for certain finite groups
• On the number of edges of cyclic subgroup graphs of finite groups

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)