Publication date
September 1985
DOI Publisher
Academic Press Inc. (London) Limited. Published by Elsevier Ltd.Abstract
We prove that the connectivity of a connected strongly regular graph equals its valency
We prove that the connectivity of a connected strongly regular graph equals its valency
We prove the non-existence of a strongly regular graph with 49 vertices and degree 16
AbstractIn this paper, we study a conjecture of Andries E. Brouwer from 1996 regarding the minimum n...
We say that a regular graph G of order n and degree r ≥ 1 (which is not the complete graph) is st...
We prove that the connectivity of a connected strongly regular graph equals its valency
We prove that the connectivity of a connected strongly regular graph equals its valency
We prove that the connectivity of a connected strongly regular graph equals its valency
We prove that the connectivity of a connected strongly regular graph equals its valency
We prove that the connectivity of a connected strongly regular graph equals its valency
We prove that the connectivity of a connected strongly regular graph equals its valency
AbstractWe show that a strongly regular graph with parameters n=57, k=14, λ=1, ν=4 ( (0,1)-eigenvalu...
AbstractFor any vertex x of a graph G let Δ(x) denote the set of vertices adjacent to x. We seek to ...
AbstractIn this paper we have tried to summarize the known results on strongly regular graphs. Both ...
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...
AbstractWe consider strongly regular graphs in which each non-adjacent pair of vertices has exactly ...
We prove the non-existence of a strongly regular graph with 49 vertices and degree 16
AbstractIn this paper, we study a conjecture of Andries E. Brouwer from 1996 regarding the minimum n...
We say that a regular graph G of order n and degree r ≥ 1 (which is not the complete graph) is st...
We prove that the connectivity of a connected strongly regular graph equals its valency
We prove that the connectivity of a connected strongly regular graph equals its valency
We prove that the connectivity of a connected strongly regular graph equals its valency
We prove that the connectivity of a connected strongly regular graph equals its valency
We prove that the connectivity of a connected strongly regular graph equals its valency
We prove that the connectivity of a connected strongly regular graph equals its valency
AbstractWe show that a strongly regular graph with parameters n=57, k=14, λ=1, ν=4 ( (0,1)-eigenvalu...
AbstractFor any vertex x of a graph G let Δ(x) denote the set of vertices adjacent to x. We seek to ...
AbstractIn this paper we have tried to summarize the known results on strongly regular graphs. Both ...
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...
AbstractWe consider strongly regular graphs in which each non-adjacent pair of vertices has exactly ...
We prove the non-existence of a strongly regular graph with 49 vertices and degree 16
AbstractIn this paper, we study a conjecture of Andries E. Brouwer from 1996 regarding the minimum n...
We say that a regular graph G of order n and degree r ≥ 1 (which is not the complete graph) is st...
Add to ORKG