Add to ORKGWe prove that the connectivity of a connected strongly regular graph equals its valency
AbstractSome connections between strongly regular graphs and finite Ramsey theory are drawn. Let Bn ...
Abstract. The notion of strongly quotient graph was introduced by Adiga et al. [3]. Here, we show th...
We give examples of vertex-transitive strongly regular graphs with a normal quotient which is neithe...
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 consider strongly regular graphs in which each non-adjacent pair of vertices has exactly ...
"A graph Γ is called strongly regular, if each vertex is adjacent to κ vertices, each adjacent pair ...
P(論文)"A graph Γ is called strongly regular, if each vertex is adjacent to κ vertices, each adjacent ...
In this paper we have tried to summarize the known results on strongly regular graphs. Both groupal ...
AbstractIn this paper we have tried to summarize the known results on strongly regular graphs. Both ...
An important property of strongly regular graphs is that the second subconstituent of any primitive ...
AbstractSome connections between strongly regular graphs and finite Ramsey theory are drawn. Let Bn ...
Abstract. The notion of strongly quotient graph was introduced by Adiga et al. [3]. Here, we show th...
We give examples of vertex-transitive strongly regular graphs with a normal quotient which is neithe...
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 consider strongly regular graphs in which each non-adjacent pair of vertices has exactly ...
"A graph Γ is called strongly regular, if each vertex is adjacent to κ vertices, each adjacent pair ...
P(論文)"A graph Γ is called strongly regular, if each vertex is adjacent to κ vertices, each adjacent ...
In this paper we have tried to summarize the known results on strongly regular graphs. Both groupal ...
AbstractIn this paper we have tried to summarize the known results on strongly regular graphs. Both ...
An important property of strongly regular graphs is that the second subconstituent of any primitive ...
AbstractSome connections between strongly regular graphs and finite Ramsey theory are drawn. Let Bn ...
Abstract. The notion of strongly quotient graph was introduced by Adiga et al. [3]. Here, we show th...
We give examples of vertex-transitive strongly regular graphs with a normal quotient which is neithe...