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
Unimodular lattices and strongly regular graphs
β Scribed by B. B. Venkov
- Publisher
- Springer US
- Year
- 1985
- Tongue
- English
- Weight
- 325 KB
- Volume
- 29
- Category
- Article
- ISSN
- 1573-8795
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
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
Starting from the even unimodular lattice E 8 E 8 , one constructs odd systems (i . e . sets of vectors with odd inner products) of 546 vectors using results of Deza and Grishukhin . One studies the subsystems consisting of 36 pairs of opposite vectors spanning equiangular lines . These subsystems r
In this paper we solve 3 of the 6 problems of A. Kotzig on regular and strongly-regular self-complementary graphs, mentioned in "Graph Theory and Related Topics" edited by J.A.