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
AbstractIn the present paper we find all the graphs on which a dihedral group acts edge-transitively...
AbstractWe introduce a family of vertex-transitive graphs with specified subgroups of automorphisms ...
Abstract(1). We determine the number of non-isomorphic classes of self-complementary circulant digra...
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 ...
AbstractSeveral groups are associated naturally with acyclic directed graphs and in particular with ...
AbstractWe study a family of vertex transitive digraphs whose vertices represent the k-permutations ...
AbstractWe prove that with the possible exception of total orders every tournament with sharply tran...
Let $G=(V, E)$ be a graph, where $V$ and $E$ are the vertex and edge sets, respectively. For two dis...
In this paper we consider decompositions of the complete graph Kv into matchings of uniform cardinal...
Given a finite group G of even order, which graphs T have a 1-factorization admitting G as an automo...
Abstract1.1. We determine all the symmetric digraphs with a prime number, p, of vertices. We also de...
The concept of a strong difference family formally introduced in Buratti [J Combin Designs 7 (1999),...
In some recent papers the method of partial differences introduced by the author in [4] was very hel...
AbstractIn this paper the following two problems are solved: Given any point-symmetric graph or digr...
AbstractIn the present paper we find all the graphs on which a dihedral group acts edge-transitively...
AbstractWe introduce a family of vertex-transitive graphs with specified subgroups of automorphisms ...
Abstract(1). We determine the number of non-isomorphic classes of self-complementary circulant digra...
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 ...
AbstractSeveral groups are associated naturally with acyclic directed graphs and in particular with ...
AbstractWe study a family of vertex transitive digraphs whose vertices represent the k-permutations ...
AbstractWe prove that with the possible exception of total orders every tournament with sharply tran...
Let $G=(V, E)$ be a graph, where $V$ and $E$ are the vertex and edge sets, respectively. For two dis...
In this paper we consider decompositions of the complete graph Kv into matchings of uniform cardinal...
Given a finite group G of even order, which graphs T have a 1-factorization admitting G as an automo...
Abstract1.1. We determine all the symmetric digraphs with a prime number, p, of vertices. We also de...
The concept of a strong difference family formally introduced in Buratti [J Combin Designs 7 (1999),...
In some recent papers the method of partial differences introduced by the author in [4] was very hel...
AbstractIn this paper the following two problems are solved: Given any point-symmetric graph or digr...
AbstractIn the present paper we find all the graphs on which a dihedral group acts edge-transitively...
AbstractWe introduce a family of vertex-transitive graphs with specified subgroups of automorphisms ...
Abstract(1). We determine the number of non-isomorphic classes of self-complementary circulant digra...
DOI
Add to ORKG