AbstractWe consider strongly regular graphs in which each non-adjacent pair of vertices has exactly one common neighbour. These graphs give rise to partial linear spaces (one of which is a partial quadrangle) and a distance-regular graph of diameter three. The lower bound for the valency of the graph in terms of the number of common neighbours of two adjacent vertices is derived
"A graph Γ is called strongly regular, if each vertex is adjacent to κ vertices, each adjacent pair ...
AbstractIn this paper, we study the distance-regular graphs Γ that have a pair of distinct vertices,...
AbstractA combinatorial construction is given of a strongly regular graph with parameters (v, k, λ, ...
AbstractWe consider strongly regular graphs in which each non-adjacent pair of vertices has exactly ...
AbstractIn this paper we prove that any strongly regular graph with μ=1 satisfies k⩾(λ+1)(λ+2) and a...
AbstractIn this paper, we study the distance-regular graphs Γ that have a pair of distinct vertices,...
AbstractWe show that a strongly regular graph with parameters n=57, k=14, λ=1, ν=4 ( (0,1)-eigenvalu...
AbstractIn this paper we have tried to summarize the known results on strongly regular graphs. Both ...
We prove that the connectivity of a connected strongly regular graph equals its valency
We give a new bound on the parameter λ (number of common neighbors of a pair of adjacent vertices) i...
AbstractFor any vertex x of a graph G let Δ(x) denote the set of vertices adjacent to x. We seek to ...
Abstract. We present a purely combinatorial construction of strongly regular graphs with geometric p...
We show, for any positive integer k, that there exists a graph in which any equitable partition of i...
AbstractDistance-regular graphs of valency > 2, diameter m, and girth 2m with the additional propert...
We show, for any positive integer k, that there exists a graph in which any equitable partition of i...
"A graph Γ is called strongly regular, if each vertex is adjacent to κ vertices, each adjacent pair ...
AbstractIn this paper, we study the distance-regular graphs Γ that have a pair of distinct vertices,...
AbstractA combinatorial construction is given of a strongly regular graph with parameters (v, k, λ, ...
AbstractWe consider strongly regular graphs in which each non-adjacent pair of vertices has exactly ...
AbstractIn this paper we prove that any strongly regular graph with μ=1 satisfies k⩾(λ+1)(λ+2) and a...
AbstractIn this paper, we study the distance-regular graphs Γ that have a pair of distinct vertices,...
AbstractWe show that a strongly regular graph with parameters n=57, k=14, λ=1, ν=4 ( (0,1)-eigenvalu...
AbstractIn this paper we have tried to summarize the known results on strongly regular graphs. Both ...
We prove that the connectivity of a connected strongly regular graph equals its valency
We give a new bound on the parameter λ (number of common neighbors of a pair of adjacent vertices) i...
AbstractFor any vertex x of a graph G let Δ(x) denote the set of vertices adjacent to x. We seek to ...
Abstract. We present a purely combinatorial construction of strongly regular graphs with geometric p...
We show, for any positive integer k, that there exists a graph in which any equitable partition of i...
AbstractDistance-regular graphs of valency > 2, diameter m, and girth 2m with the additional propert...
We show, for any positive integer k, that there exists a graph in which any equitable partition of i...
"A graph Γ is called strongly regular, if each vertex is adjacent to κ vertices, each adjacent pair ...
AbstractIn this paper, we study the distance-regular graphs Γ that have a pair of distinct vertices,...
AbstractA combinatorial construction is given of a strongly regular graph with parameters (v, k, λ, ...
DOI
Add to ORKG