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 Jg. 36; H. 3; S. 895 - 904
Hauptverfasser:	Cameron, Peter J., Jafari, Sayyed Heidar
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Tokyo Springer Japan 01.05.2020 Springer Nature B.V
Schlagworte:	Combinatorics Engineering Design Graph theory Graphs Mathematics Mathematics and Statistics Original Paper Connectivity 20D10 Power graph Cyclic group 05C25 Independence number
ISSN:	0911-0119, 1435-5914
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!