Digraphs having the property of the title were considered by Babai, Cameron, Deza and Sighi in 1981. This paper improves several of their results. Complete multipartite graphs are especially interesting; I give new constructions and nonexistence theorems for these. I also give new results on the maximum valency of arbitrary digraphs with this property.</p
AbstractWe examine edge transitivity of directed graphs. The class of local comparability graphs is ...
A finite graph Gamma is G-symmetric if it admits G as a group of automorphisms acting transitively o...
© 2015 The Authors.We give certain properties which are satisfied by the descendant set of a vertex ...
Digraphs having the property of the title were considered by Babai, Cameron, Deza and Sighi in 1981....
AbstractWe consider the problem of determining the maximum possible out-degree d(n) of a digraph on ...
A decomposition of the complete graph $K_v$ into copies of a subgraph Γ is called a sharply transiti...
Finite digrahs Г with a group G of automorphisms acting transitively on the set of s-arcs, for some ...
AbstractA digraph is k-transitive, if for any a path x0x1…xk of length k, x0 dominates xk. A digraph...
In [6] it was shown that properties of digraphs such as growth, property Z, and num-ber of ends are ...
The concept of a strong difference family formally introduced in Buratti [J Combin Designs 7 (1999),...
AbstractIt was conjectured (see [D. Marušič, On vertex symmetric digraphs, Discrete Math. 36 (1981) ...
A digraph (that is a directed graph) is said to be highly arc transitive if its automorphism group i...
Abstract(1). We determine the number of non-isomorphic classes of self-complementary circulant digra...
We decide the Borel complexity of the conjugacy problem for automorphism groups of countable homogen...
AbstractWe prove that with the possible exception of total orders every tournament with sharply tran...
AbstractWe examine edge transitivity of directed graphs. The class of local comparability graphs is ...
A finite graph Gamma is G-symmetric if it admits G as a group of automorphisms acting transitively o...
© 2015 The Authors.We give certain properties which are satisfied by the descendant set of a vertex ...
Digraphs having the property of the title were considered by Babai, Cameron, Deza and Sighi in 1981....
AbstractWe consider the problem of determining the maximum possible out-degree d(n) of a digraph on ...
A decomposition of the complete graph $K_v$ into copies of a subgraph Γ is called a sharply transiti...
Finite digrahs Г with a group G of automorphisms acting transitively on the set of s-arcs, for some ...
AbstractA digraph is k-transitive, if for any a path x0x1…xk of length k, x0 dominates xk. A digraph...
In [6] it was shown that properties of digraphs such as growth, property Z, and num-ber of ends are ...
The concept of a strong difference family formally introduced in Buratti [J Combin Designs 7 (1999),...
AbstractIt was conjectured (see [D. Marušič, On vertex symmetric digraphs, Discrete Math. 36 (1981) ...
A digraph (that is a directed graph) is said to be highly arc transitive if its automorphism group i...
Abstract(1). We determine the number of non-isomorphic classes of self-complementary circulant digra...
We decide the Borel complexity of the conjugacy problem for automorphism groups of countable homogen...
AbstractWe prove that with the possible exception of total orders every tournament with sharply tran...
AbstractWe examine edge transitivity of directed graphs. The class of local comparability graphs is ...
A finite graph Gamma is G-symmetric if it admits G as a group of automorphisms acting transitively o...
© 2015 The Authors.We give certain properties which are satisfied by the descendant set of a vertex ...
DOI
Add to ORKG