Disconnecting strongly regular graphs

作者：Cioaba Sebastian M^*; Koolen Jack; Li Weiqiang

来源：European Journal of Combinatorics, 2014, 38: 1-11.

DOI：10.1016/j.ejc.2013.10.008

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.

• 出版日期2014-5
• 单位中国科学技术大学