AbstractWe define a class of digraphs involving differences in a group that generalizes Cayley digraphs, that we call difference digraphs. We define also a new combinatorial structure, called partial sum family, or PSF for short, from which we obtain difference digraphs that are directed strongly regular graphs. We give an infinite family of PSFs and we give also twelve sporadic ones that generate directed strongly regular graphs whose existence was previously undecided
AbstractThe classification problem for strongly regular graphs for which the parameters are related ...
Abstract We introduce a special kind of partial sum families, which we call equisizable partial sum...
AbstractIn this paper we have tried to summarize the known results on strongly regular graphs. Both ...
AbstractWe define a class of digraphs involving differences in a group that generalizes Cayley digra...
AbstractIn this paper, bounds for the edge connectivity of m-Cayley graphs are found, and also sever...
AbstractWe construct a new infinite family of directed strongly regular graphs, as Cayley graphs of ...
AbstractAs a generalization of undirected strongly regular graphs, a digraph X without loops, of val...
AbstractAs a generalization of undirected strongly regular graphs, a digraph X without loops, of val...
A regular graph $\Gamma$ with $v$ vertices and valency $k$ is said to be a $(v,k,\lambda, \mu)$-stro...
AbstractThe classification problem for strongly regular graphs for which the parameters are related ...
We report about the results of the application of modern computer algebra tools for construction of ...
In this article we generalize a theorem of Benson (J Algebra 15:443–454, 1970) for generalized quadr...
AbstractWe construct a new infinite family of directed strongly regular graphs, as Cayley graphs of ...
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 classification problem for strongly regular graphs for which the parameters are related ...
Abstract We introduce a special kind of partial sum families, which we call equisizable partial sum...
AbstractIn this paper we have tried to summarize the known results on strongly regular graphs. Both ...
AbstractWe define a class of digraphs involving differences in a group that generalizes Cayley digra...
AbstractIn this paper, bounds for the edge connectivity of m-Cayley graphs are found, and also sever...
AbstractWe construct a new infinite family of directed strongly regular graphs, as Cayley graphs of ...
AbstractAs a generalization of undirected strongly regular graphs, a digraph X without loops, of val...
AbstractAs a generalization of undirected strongly regular graphs, a digraph X without loops, of val...
A regular graph $\Gamma$ with $v$ vertices and valency $k$ is said to be a $(v,k,\lambda, \mu)$-stro...
AbstractThe classification problem for strongly regular graphs for which the parameters are related ...
We report about the results of the application of modern computer algebra tools for construction of ...
In this article we generalize a theorem of Benson (J Algebra 15:443–454, 1970) for generalized quadr...
AbstractWe construct a new infinite family of directed strongly regular graphs, as Cayley graphs of ...
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 classification problem for strongly regular graphs for which the parameters are related ...
Abstract We introduce a special kind of partial sum families, which we call equisizable partial sum...
AbstractIn this paper we have tried to summarize the known results on strongly regular graphs. Both ...