Disconnecting strongly regular graphs

详细信息    查看全文

• 作者：Sebastian M. Cioab膬 ; Jack Koolen ; Weiqiang Li
• 刊名：European Journal of Combinatorics
• 出版年：May, 2014
• 年：2014
• 卷：38
• 期：Complete
• 页码：1-11
• 全文大小：417 K

文摘

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.