A census of 4-valent half-arc-transitive graphs and arc-transitive digraphs of valence two
نویسندگان
چکیده
منابع مشابه
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.
متن کاملWeakly Flag-transitive Configurations and Half-arc-transitive Graphs
A connguration is weakly ag-transitive if its group of automor-phisms acts intransitively on ags but the group of all automorphisms and anti-automorphisms acts transitively on ags. It is shown that weakly ag-transitive conngurations are in one-to-one correspondence with bipartite 1 2-arc-transitive graphs of girth not less than 6. Several innnite families of weakly ag-transitive conngurations a...
متن کاملWeakly Flag-transitive Configurations and Half-arc-transitive Graphs
A con guration is weakly ag transitive if its group of automor phisms acts intransitively on ags but the group of all automorphisms and anti automorphisms acts transitively on ags It is shown that weakly ag transitive con gurations are in one to one correspondence with bipartite arc transitive graphs of girth not less than Sev eral in nite families of weakly ag transitive con gurations are gi...
متن کاملHalf-arc-transitive graphs and chiral hypermaps
A subgroup G of automorphisms of a graph X is said to be 2 -arc-transitive if it is vertexand edgebut not arc-transitive. The graph X is said to be 2 -arc-transitive if Aut X is 1 2 -arc-transitive. The interplay of two different concepts, maps and hypermaps on one side and 2 -arc-transitive group actions on graphs on the other, is investigated. The correspondence between regular maps and 2 -ar...
متن کاملSuper-connected arc-transitive digraphs
A digraph is said to be super-connected if every minimum vertex cut is the out-neighbor set or in-neighbor set of a vertex. A digraph is said to be reducible, if there are two vertices with the same out-neighbor set or the same in-neighbor set. In this paper, we prove that a strongly connected arc-transitive oriented graph is either reducible or super-connected. Furthermore, if this digraph is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ars Mathematica Contemporanea
سال: 2014
ISSN: 1855-3974,1855-3966
DOI: 10.26493/1855-3974.559.c6c