On the Connectivity and Independence Number of Power Graphs of Groups

Let G be a group. The power graph of G is a graph with vertex set G in which two distinct elements x ,  y are adjacent if one of them is a power of the other. We characterize all groups whose power graphs have finite independence number, show that they have clique cover number equal to their indepen...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Graphs and combinatorics 2020-05, Vol.36 (3), p.895-904
Hauptverfasser:	Cameron, Peter J., Jafari, Sayyed Heidar
Format:	Artikel
Sprache:	eng
Schlagworte:	Combinatorics Engineering Design Graph theory Graphs Mathematics Mathematics and Statistics Original Paper
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!