Some characterizations of strongly regular graphs
✍ Scribed by Mirko Lepović
- Book ID
- 107619787
- Publisher
- Springer-Verlag
- Year
- 2008
- Tongue
- English
- Weight
- 317 KB
- Volume
- 29
- Category
- Article
- ISSN
- 1598-5865
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
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
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