AbstractAs a generalization of undirected strongly regular graphs, a digraph X without loops, of valency k and order v is said to be a (v,k,μ,λ,t)-directed strongly regular graph whenever for any vertex u of X there are t undirected edges having u as an endvertex and for every two different vertices u and w of X the number of paths of length 2 starting at u and ending at w is λ or μ depending only on whether uw is an arc of X or not. An m-Cayley digraph of a group H is a digraph admitting a semiregular group of automorphisms having m orbits, all of equal length, isomorphic to H. In this paper, the structure of directed strongly regular 2-Cayley graphs of cyclic groups is investigated. In particular, the arithmetic conditions on parameters v...
AbstractThis paper characterizes directed graphs which are Cayley graphs of strong semilattices of g...
We report about the results of the application of modern computer algebra tools for construction of ...
AbstractThe complete generalized cycleG(d,n) is the digraph which hasZn×Zdas the vertex set and ever...
AbstractAs a generalization of undirected strongly regular graphs, a digraph X without loops, of val...
AbstractWe define a class of digraphs involving differences in a group that generalizes Cayley digra...
AbstractWe construct a new infinite family of directed strongly regular graphs, as Cayley graphs of ...
AbstractIn this paper, bounds for the edge connectivity of m-Cayley graphs are found, and also sever...
AbstractDirected strongly regular graphs with μ=λ=t−1 and k−1 divisible by μ are constructed from cy...
A graph is a directed strongly regular graph (DSRG) if and only if the number of paths of length 2 f...
A graph is a directed strongly regular graph (DSRG) if and only if the number of paths of length 2 f...
AbstractAn n-bicirculant is a graph having an automorphism with two orbits of length n and no other ...
AbstractIn this paper we prove that any strongly regular graph with μ=1 satisfies k⩾(λ+1)(λ+2) and a...
AbstractThe classification problem for strongly regular graphs for which the parameters are related ...
AbstractA graph is called tri-Cayley if it admits a semiregular subgroup of automorphisms having thr...
AbstractWe study a directed graph version of strongly regular graphs whose adjacency matrices satisf...
AbstractThis paper characterizes directed graphs which are Cayley graphs of strong semilattices of g...
We report about the results of the application of modern computer algebra tools for construction of ...
AbstractThe complete generalized cycleG(d,n) is the digraph which hasZn×Zdas the vertex set and ever...
AbstractAs a generalization of undirected strongly regular graphs, a digraph X without loops, of val...
AbstractWe define a class of digraphs involving differences in a group that generalizes Cayley digra...
AbstractWe construct a new infinite family of directed strongly regular graphs, as Cayley graphs of ...
AbstractIn this paper, bounds for the edge connectivity of m-Cayley graphs are found, and also sever...
AbstractDirected strongly regular graphs with μ=λ=t−1 and k−1 divisible by μ are constructed from cy...
A graph is a directed strongly regular graph (DSRG) if and only if the number of paths of length 2 f...
A graph is a directed strongly regular graph (DSRG) if and only if the number of paths of length 2 f...
AbstractAn n-bicirculant is a graph having an automorphism with two orbits of length n and no other ...
AbstractIn this paper we prove that any strongly regular graph with μ=1 satisfies k⩾(λ+1)(λ+2) and a...
AbstractThe classification problem for strongly regular graphs for which the parameters are related ...
AbstractA graph is called tri-Cayley if it admits a semiregular subgroup of automorphisms having thr...
AbstractWe study a directed graph version of strongly regular graphs whose adjacency matrices satisf...
AbstractThis paper characterizes directed graphs which are Cayley graphs of strong semilattices of g...
We report about the results of the application of modern computer algebra tools for construction of ...
AbstractThe complete generalized cycleG(d,n) is the digraph which hasZn×Zdas the vertex set and ever...