AbstractWe develop a theory of representations in Rm for directed strongly regular graphs, which gives a new proof of a nonexistence condition of Jørgensen [L.K. Jørgensen, Non-existence of directed strongly regular graphs, Discrete Math. 264 (2003) 111–126]. We also describe some new constructions
We prove the non-existence of a strongly regular graph with 49 vertices and degree 16
A simplified version of the theory of strongly regular graphs is developed for the case in which the...
We show that a strongly regular graph with parameters n=57, K=14, ¿=1, ¿=4 ( (0,1)-eigenvalues: 1*14...
AbstractWe develop a theory of representations in Rm for directed strongly regular graphs, which giv...
AbstractDirected strongly regular graphs with μ=λ=t−1 and k−1 divisible by μ are constructed from cy...
AbstractWe consider directed strongly regular graphs defined in 1988 by Duval. All such graphs with ...
We study a directed graph version of strongly regular graphs whose adjacency matrices satisfy A^2 + ...
AbstractThe notion of a directed strongly regular graph was introduced by A. Duval in 1988 as one of...
In this paper we have tried to summarize the known results on strongly regular graphs. Both groupal ...
The concept of directed strongly regular graphs was introduced by Duval in “A Directed Graph Version...
AbstractIn this paper we have tried to summarize the known results on strongly regular graphs. Both ...
We report about the results of the application of modern computer algebra tools for construction of ...
Introduction. A strongly regular graph with 49 vertices and degree 16 has parameters (v, k, ¿, µ) = ...
AbstractWe study a directed graph version of strongly regular graphs whose adjacency matrices satisf...
AbstractFor a positive integer r we consider the set Br of all values of kn for which there exists a...
We prove the non-existence of a strongly regular graph with 49 vertices and degree 16
A simplified version of the theory of strongly regular graphs is developed for the case in which the...
We show that a strongly regular graph with parameters n=57, K=14, ¿=1, ¿=4 ( (0,1)-eigenvalues: 1*14...
AbstractWe develop a theory of representations in Rm for directed strongly regular graphs, which giv...
AbstractDirected strongly regular graphs with μ=λ=t−1 and k−1 divisible by μ are constructed from cy...
AbstractWe consider directed strongly regular graphs defined in 1988 by Duval. All such graphs with ...
We study a directed graph version of strongly regular graphs whose adjacency matrices satisfy A^2 + ...
AbstractThe notion of a directed strongly regular graph was introduced by A. Duval in 1988 as one of...
In this paper we have tried to summarize the known results on strongly regular graphs. Both groupal ...
The concept of directed strongly regular graphs was introduced by Duval in “A Directed Graph Version...
AbstractIn this paper we have tried to summarize the known results on strongly regular graphs. Both ...
We report about the results of the application of modern computer algebra tools for construction of ...
Introduction. A strongly regular graph with 49 vertices and degree 16 has parameters (v, k, ¿, µ) = ...
AbstractWe study a directed graph version of strongly regular graphs whose adjacency matrices satisf...
AbstractFor a positive integer r we consider the set Br of all values of kn for which there exists a...
We prove the non-existence of a strongly regular graph with 49 vertices and degree 16
A simplified version of the theory of strongly regular graphs is developed for the case in which the...
We show that a strongly regular graph with parameters n=57, K=14, ¿=1, ¿=4 ( (0,1)-eigenvalues: 1*14...
DOI
Add to ORKG