DOIAbstract
AbstractDirected strongly regular graphs with μ=λ=t−1 and k−1 divisible by μ are constructed from cyclic groups. Nonexistence of a directed strongly regular graph with n=32,k=6,t=5,μ=λ=1 is proved
AbstractDirected strongly regular graphs with μ=λ=t−1 and k−1 divisible by μ are constructed from cyclic groups. Nonexistence of a directed strongly regular graph with n=32,k=6,t=5,μ=λ=1 is proved
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...
A simplified version of the theory of strongly regular graphs is developed for the case in which the...
AbstractWe develop a theory of representations in Rm for directed strongly regular graphs, which giv...
We prove the non-existence of a strongly regular graph with 49 vertices and degree 16
Introduction. A strongly regular graph with 49 vertices and degree 16 has parameters (v, k, ¿, µ) = ...
AbstractWe consider directed strongly regular graphs defined in 1988 by Duval. All such graphs with ...
The concept of directed strongly regular graphs was introduced by Duval in “A Directed Graph Version...
AbstractWe show that a strongly regular graph with parameters n=57, k=14, λ=1, ν=4 ( (0,1)-eigenvalu...
We show that a strongly regular graph with parameters n=57, K=14, ¿=1, ¿=4 ( (0,1)-eigenvalues: 1*14...
In this paper we have tried to summarize the known results on strongly regular graphs. Both groupal ...
We study a directed graph version of strongly regular graphs whose adjacency matrices satisfy A^2 + ...
AbstractIn this paper we have tried to summarize the known results on strongly regular graphs. Both ...
AbstractThe notion of a directed strongly regular graph was introduced by A. Duval in 1988 as one of...
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...
A simplified version of the theory of strongly regular graphs is developed for the case in which the...
AbstractWe develop a theory of representations in Rm for directed strongly regular graphs, which giv...
We prove the non-existence of a strongly regular graph with 49 vertices and degree 16
Introduction. A strongly regular graph with 49 vertices and degree 16 has parameters (v, k, ¿, µ) = ...
AbstractWe consider directed strongly regular graphs defined in 1988 by Duval. All such graphs with ...
The concept of directed strongly regular graphs was introduced by Duval in “A Directed Graph Version...
AbstractWe show that a strongly regular graph with parameters n=57, k=14, λ=1, ν=4 ( (0,1)-eigenvalu...
We show that a strongly regular graph with parameters n=57, K=14, ¿=1, ¿=4 ( (0,1)-eigenvalues: 1*14...
In this paper we have tried to summarize the known results on strongly regular graphs. Both groupal ...
We study a directed graph version of strongly regular graphs whose adjacency matrices satisfy A^2 + ...
AbstractIn this paper we have tried to summarize the known results on strongly regular graphs. Both ...
AbstractThe notion of a directed strongly regular graph was introduced by A. Duval in 1988 as one of...
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...
A simplified version of the theory of strongly regular graphs is developed for the case in which the...
Add to ORKG