We prove that, given a finite graph Σ satisfying some mild conditions, there exist infinitely many tetravalent half-arc-transitive normal covers of Σ. Applying this result, we establish the existence of infinite families of finite tetravalent half-arc-transitive graphs with certain vertex stabilizers, and classify the vertex stabilizers up to order 28 of finite connected tetravalent half-arc-transitive graphs. This sheds some new light on the longstanding problem of classifying the vertex stabilizers of finite tetravalent half-arc-transitive graphs.
Spiga, P., Xia, B. (2021). Constructing infinitely many half-arc-transitive covers of tetravalent graphs. JOURNAL OF COMBINATORIAL THEORY. SERIES A, 180 [10.1016/j.jcta.2021.105406].
Constructing infinitely many half-arc-transitive covers of tetravalent graphs
Spiga P.
;
2021
Abstract
We prove that, given a finite graph Σ satisfying some mild conditions, there exist infinitely many tetravalent half-arc-transitive normal covers of Σ. Applying this result, we establish the existence of infinite families of finite tetravalent half-arc-transitive graphs with certain vertex stabilizers, and classify the vertex stabilizers up to order 28 of finite connected tetravalent half-arc-transitive graphs. This sheds some new light on the longstanding problem of classifying the vertex stabilizers of finite tetravalent half-arc-transitive graphs.File | Dimensione | Formato | |
---|---|---|---|
Spiga-2021-J Comb Theory Series A-preprint.pdf
accesso aperto
Descrizione: Research Article
Tipologia di allegato:
Submitted Version (Pre-print)
Licenza:
Creative Commons
Dimensione
199.8 kB
Formato
Adobe PDF
|
199.8 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.