Disconnecting strongly regular graphs
Combinatorics
2013-11-25 v1 Discrete Mathematics
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 blocks graphs of Steiner -designs, many Latin square graphs and strongly regular graphs whose intersection parameters are at most a quarter of their valency.
Keywords
Cite
@article{arxiv.1311.5634,
title = {Disconnecting strongly regular graphs},
author = {Sebastian M. Cioabă and Jack H. Koolen and Weiqiang Li},
journal= {arXiv preprint arXiv:1311.5634},
year = {2013}
}