AbstractWe enumerate, up to isomorphism, several classes of labeled vertex-transitive digraphs with a prime number of vertices
AbstractThe results of Širáň and the first author [A construction of vertex-transitive non-Cayley gr...
AbstractWe study a family of vertex transitive digraphs whose vertices represent the k-permutations ...
AbstractA nonidentity element of a permutation group is said to be semiregular if all of its orbits ...
Abstract(1). We determine the number of non-isomorphic classes of self-complementary circulant digra...
Abstract1.1. We determine all the symmetric digraphs with a prime number, p, of vertices. We also de...
AbstractWe enumerate, up to isomorphism, several classes of labeled vertex-transitive digraphs with ...
AbstractIn this paper the following two problems are solved: Given any point-symmetric graph or digr...
AbstractIt is proved that if p is a prime, k and m⩽p are positive integers, and I is a vertex symmet...
AbstractA graph is self-complementary if it is isomorphic to its complement. A graph is vertex trans...
AbstractThe class of self-complementary symmetric digraphs is characterized and it is shown that the...
AbstractThe main result of this paper is that vertex-transitive graphs and digraphs of orderp4are Ha...
AbstractFor an integer n and a prime p, let n(p)=max{i:pidividesn}. In this paper, we present a cons...
Digraphs having the property of the title were considered by Babai, Cameron, Deza and Sighi in 1981....
A graph is self-complementary if it is isomorphic to its complement. A graph is vertex transitive if...
A graph is self-complementary if it is isomorphic to its complement. A graph is vert...
AbstractThe results of Širáň and the first author [A construction of vertex-transitive non-Cayley gr...
AbstractWe study a family of vertex transitive digraphs whose vertices represent the k-permutations ...
AbstractA nonidentity element of a permutation group is said to be semiregular if all of its orbits ...
Abstract(1). We determine the number of non-isomorphic classes of self-complementary circulant digra...
Abstract1.1. We determine all the symmetric digraphs with a prime number, p, of vertices. We also de...
AbstractWe enumerate, up to isomorphism, several classes of labeled vertex-transitive digraphs with ...
AbstractIn this paper the following two problems are solved: Given any point-symmetric graph or digr...
AbstractIt is proved that if p is a prime, k and m⩽p are positive integers, and I is a vertex symmet...
AbstractA graph is self-complementary if it is isomorphic to its complement. A graph is vertex trans...
AbstractThe class of self-complementary symmetric digraphs is characterized and it is shown that the...
AbstractThe main result of this paper is that vertex-transitive graphs and digraphs of orderp4are Ha...
AbstractFor an integer n and a prime p, let n(p)=max{i:pidividesn}. In this paper, we present a cons...
Digraphs having the property of the title were considered by Babai, Cameron, Deza and Sighi in 1981....
A graph is self-complementary if it is isomorphic to its complement. A graph is vertex transitive if...
A graph is self-complementary if it is isomorphic to its complement. A graph is vert...
AbstractThe results of Širáň and the first author [A construction of vertex-transitive non-Cayley gr...
AbstractWe study a family of vertex transitive digraphs whose vertices represent the k-permutations ...
AbstractA nonidentity element of a permutation group is said to be semiregular if all of its orbits ...
DOI
Add to ORKG