✦ LIBER ✦

The Connectivity of Strongly Regular Graphs

✍ Scribed by Brouwer, A.E.; Mesner, D.M.

Book ID: 122069390
Publisher: Elsevier Science
Year: 1985
Tongue: English
Weight: 140 KB
Volume: 6
Category: Article
ISSN: 0195-6698
DOI: 10.1016/S0195-6698(85)80030-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On a conjecture of Brouwer involving the

On a conjecture of Brouwer involving the connectivity of strongly regular graphs

✍ Sebastian M. Cioabă; Kijung Kim; Jack H. Koolen 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 285 KB

Random strongly regular graphs?

✍ Peter J. Cameron 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 289 KB

Strongly regular graphs lie on the cusp between highly structured and unstructured. For example, there is a unique strongly regular graph with parameters (36; 10; 4; 2), but there are 32548 non-isomorphic graphs with parameters (36; 15; 6; 6). (The ÿrst assertion is a special case of a theorem of Sh

Random strongly regular graphs?

✍ Peter J. Cameron 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 203 KB

Strongly walk-regular graphs

✍ van Dam, E.R.; Omidi, G.R. 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 160 KB

Disconnecting strongly regular graphs

✍ Cioabă, Sebastian M.; Koolen, Jack; Li, Weiqiang 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 418 KB

Distance regular graphs of diameter 3 an

Distance regular graphs of diameter 3 and strongly regular graphs

✍ A.E Brouwer 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 124 KB

In [1] N.L. Biggs mentions two parameter sets for distance regular graphs that are antipodal covers of a complete graph, for which existence of a corresponding graph was unknown. Here we settle both cases by proving that one does not exist, while there are exactly two nonisomorphic solutions to the