Symmetric cubic graphs via rigid cells

Properties of symmetric cubic graphs are described via their rigid cells , which are maximal connected subgraphs fixed pointwise by some involutory automorphism of the graph. This paper completes the description of rigid cells and the corresponding involutions for each of the 17 ‘action types’ of sy...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of algebraic combinatorics 2021-05, Vol.53 (3), p.881-895
Hauptverfasser:	Conder, Marston D. E., Hujdurović, Ademir, Kutnar, Klavdija, Marušič, Dragan
Format:	Artikel
Sprache:	eng
Schlagworte:	Automorphisms Combinatorics Computer Science Convex and Discrete Geometry Graph theory Graphs Group Theory and Generalizations Lattices Mathematics Mathematics and Statistics Order Ordered Algebraic Structures
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	Properties of symmetric cubic graphs are described via their rigid cells , which are maximal connected subgraphs fixed pointwise by some involutory automorphism of the graph. This paper completes the description of rigid cells and the corresponding involutions for each of the 17 ‘action types’ of symmetric cubic graphs.
ISSN:	0925-9899 1572-9192
DOI:	10.1007/s10801-020-00946-3