On a conjecture of Brouwer
Presented by Dr. Jack KOOLEN
Type: Oral presentation
Track: Representations of Graphs
Brouwer and Mesner showed that the connectivity of a connected strongly regular graph is its valency. If you now ask what is the minimal size of a set you have to throw away such that all the remaining components have size at least 2 and there are at least two components, then a natural guess would be the size of the neighbourhood of an edge $xy$ which has size $2k-2 - \lamda$. Brower conjectured that this is true for strongly regular graphs. In this talk I will discuss this conjecrture. This is jont work with S. Cioaba and Kijung Kim.