Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4656767 | Journal of Combinatorial Theory, Series B | 2015 | 33 Pages |
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|Gv|≤2436 or 2|Gv|log2(|Gv|/2)≤|VΓ|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.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Primož Potočnik, Pablo Spiga, Gabriel Verret,