Strongly regular graphs with λ=1
✍ Scribed by A. A. Makhnev
- Publisher
- SP MAIK Nauka/Interperiodica
- Year
- 1988
- Tongue
- English
- Weight
- 295 KB
- Volume
- 44
- Category
- Article
- ISSN
- 0001-4346
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
We consider strongly regular graphs in which each non-adjacent pair of vertices has exactly one common neighbour. These graphs give rise to partial linear spaces (one of which is a partial quadrangle) and a distance-regular graph of diameter three. The lower bound for the valency of the graph in ter
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