A census of 4-valent half-arc-transitive graphs and arc- transitive digraphs of valence two
نویسندگان
چکیده
A complete list of all connected arc-transitive asymmetric digraphs of in-valence and out-valence 2 on up to 1000 vertices is presented. As a byproduct, a complete list of all connected 4-valent graphs admitting a 12 -arc-transitive group of automorphisms on up to 1000 vertices is obtained. Several graph-theoretical properties of the elements of our census are calculated and discussed.
منابع مشابه
Two-geodesic transitive graphs of prime power order
In a non-complete graph $Gamma$, a vertex triple $(u,v,w)$ with $v$ adjacent to both $u$ and $w$ is called a $2$-geodesic if $uneq w$ and $u,w$ are not adjacent. The graph $Gamma$ is said to be $2$-geodesic transitive if its automorphism group is transitive on arcs, and also on 2-geodesics. We first produce a reduction theorem for the family of $2$-geodesic transitive graphs of prime power or...
متن کاملHighly arc-transitive digraphs – counterexamples and structure∗
We resolve two problems of [Cameron, Praeger, and Wormald – Infinite highly arc transitive digraphs and universal covering digraphs, Combinatorica 1993]. First, we construct a locally finite highly arc-transitive digraph with universal reachability relation. Second, we provide constructions of 2-ended highly arc transitive digraphs where each ‘building block’ is a finite bipartite graph that is...
متن کاملHighly arc-transitive digraphs - Structure and counterexamples
Two problems of Cameron, Praeger, and Wormald [Infinite highly arc transitive digraphs and universal covering digraphs, Combinatorica (1993)] are resolved. First, locally finite highly arc-transitive digraphs with universal reachability relation are presented. Second, constructions of two-ended highly arc-transitive digraphs are provided, where each ‘building block’ is a finite bipartite digrap...
متن کاملOn symmetries of Cayley graphs and the graphs underlying regular maps
By definition, Cayley graphs are vertex-transitive, and graphs underlying regular or orientably-regular maps (on surfaces) are arc-transitive. This paper addresses questions about how large the automorphism groups of such graphs can be. In particular, it is shown how to construct 3-valent Cayley graphs that are 5-arc-transitive (in answer to a question by Cai Heng Li), and Cayley graphs of vale...
متن کاملA tetravalent half-arc-transitive graph with non-abelian vertex stabilizer
A construction is given of a valent arc transitive graph with vertex stabilizer isomorphic to the dihedral group D The graph has vertices and is the rst known example of a valent arc transitive graph with nonabelian vertex stabilizer A VALENT HALF ARC TRANSITIVE GRAPH
متن کامل