AbstractWe construct a new infinite family of directed strongly regular graphs, as Cayley graphs of certain semidirect product groups. This generalizes an earlier construction of Klin, Munemasa, Muzychuk, and Zieschang on some dihedral groups
AbstractThis paper characterizes directed graphs which are Cayley graphs of strong semilattices of g...
AbstractWe develop a theory of representations in Rm for directed strongly regular graphs, which giv...
AbstractWe consider directed strongly regular graphs defined in 1988 by Duval. All such graphs with ...
AbstractWe construct a new infinite family of directed strongly regular graphs, as Cayley graphs of ...
AbstractWe define a class of digraphs involving differences in a group that generalizes Cayley digra...
AbstractAs a generalization of undirected strongly regular graphs, a digraph X without loops, of val...
AbstractDirected strongly regular graphs with μ=λ=t−1 and k−1 divisible by μ are constructed from cy...
AbstractAs a generalization of undirected strongly regular graphs, a digraph X without loops, of val...
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...
AbstractThe notion of a directed strongly regular graph was introduced by A. Duval in 1988 as one of...
We report about the results of the application of modern computer algebra tools for construction of ...
AbstractWe study a directed graph version of strongly regular graphs whose adjacency matrices satisf...
The concept of directed strongly regular graphs was introduced by Duval in “A Directed Graph Version...
AbstractWe define a class of digraphs involving differences in a group that generalizes Cayley digra...
AbstractThis paper characterizes directed graphs which are Cayley graphs of strong semilattices of g...
AbstractWe develop a theory of representations in Rm for directed strongly regular graphs, which giv...
AbstractWe consider directed strongly regular graphs defined in 1988 by Duval. All such graphs with ...
AbstractWe construct a new infinite family of directed strongly regular graphs, as Cayley graphs of ...
AbstractWe define a class of digraphs involving differences in a group that generalizes Cayley digra...
AbstractAs a generalization of undirected strongly regular graphs, a digraph X without loops, of val...
AbstractDirected strongly regular graphs with μ=λ=t−1 and k−1 divisible by μ are constructed from cy...
AbstractAs a generalization of undirected strongly regular graphs, a digraph X without loops, of val...
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...
AbstractThe notion of a directed strongly regular graph was introduced by A. Duval in 1988 as one of...
We report about the results of the application of modern computer algebra tools for construction of ...
AbstractWe study a directed graph version of strongly regular graphs whose adjacency matrices satisf...
The concept of directed strongly regular graphs was introduced by Duval in “A Directed Graph Version...
AbstractWe define a class of digraphs involving differences in a group that generalizes Cayley digra...
AbstractThis paper characterizes directed graphs which are Cayley graphs of strong semilattices of g...
AbstractWe develop a theory of representations in Rm for directed strongly regular graphs, which giv...
AbstractWe consider directed strongly regular graphs defined in 1988 by Duval. All such graphs with ...
DOI
Add to ORKG