Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4653671 | European Journal of Combinatorics | 2014 | 11 Pages |
Abstract
In this paper, we show that the minimum number of vertices whose removal disconnects a connected strongly regular graph into non-singleton components equals the size of the neighborhood of an edge for many graphs. These include block graphs of Steiner 2-designs, many Latin square graphs and strongly regular graphs whose intersection parameters are at most a quarter of their valency.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Sebastian M. Cioabă, Jack Koolen, Weiqiang Li,