The Connectivity of Strongly Regular Graphs

  title={The Connectivity of Strongly Regular Graphs},
  author={Andries E. Brouwer and Dale M. Mesner},
  journal={Eur. J. Comb.},
A strongly regular graph (with parameters v, k, A, JL) is a finite undirected graph without loops or multiple edges such that (i) has v vertices, (ii) it is regular of degree k, (iii) each edge is in A triangles, (iv) any two.nonadjacent points are joined by JL paths of length 2. For basic properties see Cameron [1] or Seidel [3]. The connectivity of a graph is the minimum number of vertices one has to remove in oroer to make it disconnected (or empty). Our aim is to prove the following… CONTINUE READING
Highly Cited
This paper has 42 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.


Publications citing this paper.


Publications referenced by this paper.
Showing 1-2 of 2 references

J . J . Seidel , Strongly regular graphs with ( - 1 , 1 , 0 ) adjacent matrix having eigenvalue 3 , Lin . Alg . AppI

M. Doob Cvetkovic

Surveys in Combinatorics (B

D. M. Cvetkovic, M. Doob, +6 authors pp. 157-180 in
Bollobas, ed.), London Math. Soc. Lecture Note Series 38, Cambridge 1979. 4. J. J. Seidel, Strongly regular graphs with (-1,1,0) adjacent matrix having eigenvalue 3, Lin. Alg. AppI. 1 • 1968
View 1 Excerpt