On the structure of the power graph and the enhanced power graph of a group

Ghodratallah Aalipour, Saieed Akbari, Peter Jephson Cameron, Reza Nikandish, Farzad Shaveisi

Research output: Contribution to journalArticlepeer-review

30 Citations (Scopus)

Abstract

Let G be a group. The power graph of G is a graph with the vertex set G, having an edge between two elements whenever one is a power of the other. We characterize nilpotent groups whose power graphs have finite independence number.

For a bounded exponent group, we prove its power graph is a perfect graph and we determine its clique/chromatic number. Furthermore, it is proved that for every group G, the clique number of the power graph of G is at most countably infinite. We also measure how close the power graph is to the commuting graph by introducing a new graph which lies in between. We call this new graph the enhanced power graph.

For an arbitrary pair of these three graphs we characterize finite groups for which
this pair of graphs are equal.
Original languageEnglish
Article number3.16
Number of pages18
JournalElectronic Journal of Combinatorics
Volume24
Issue number3
Publication statusPublished - 27 Jul 2017

Keywords

  • power graph
  • clique number
  • group
  • independence number
  • chromatic number

Fingerprint

Dive into the research topics of 'On the structure of the power graph and the enhanced power graph of a group'. Together they form a unique fingerprint.

Cite this