The main result of this paper is that, if Γ is a connected 4-valent G-arc-transitive graph and v is a vertex of Γ, then either Γ is part of a well-understood infinite family of graphs, or |Gv|≤2436 or 2|Gv|log2(|Gv|/2)≤|VΓ| and that this last bound is tight. As a corollary, we get a similar result for 3-valent vertex-transitive graphs.
Potočnik, P., Spiga, P., Verret, G. (2015). Bounding the order of the vertex-stabiliser in 3-valent vertex-transitive and 4-valent arc-transitive graphs. JOURNAL OF COMBINATORIAL THEORY, 111, 148-180 [10.1016/j.jctb.2014.10.002].
Bounding the order of the vertex-stabiliser in 3-valent vertex-transitive and 4-valent arc-transitive graphs
SPIGA, PABLOSecondo
;
2015
Abstract
The main result of this paper is that, if Γ is a connected 4-valent G-arc-transitive graph and v is a vertex of Γ, then either Γ is part of a well-understood infinite family of graphs, or |Gv|≤2436 or 2|Gv|log2(|Gv|/2)≤|VΓ| and that this last bound is tight. As a corollary, we get a similar result for 3-valent vertex-transitive graphs.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
1-s2.0-S0095895614001191-main.pdf
Solo gestori archivio
Tipologia di allegato:
Publisher’s Version (Version of Record, VoR)
Dimensione
683.81 kB
Formato
Adobe PDF
|
683.81 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
