Regular two-graphs on 36 vertices (Q1899427)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 803755
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Regular two-graphs on 36 vertices |
scientific article; zbMATH DE number 803755 |
Statements
Regular two-graphs on 36 vertices (English)
0 references
31 March 1996
0 references
An algorithm for generating regular two-graphs by computer is described. The algorithm is applied for the construction of 136 new two-graphs on 36 vertices. These graphs lead to a large number of strongly regular graphs, Hadamard designs and Hadamard matrices of order 36.
0 references
algorithm
0 references
two-graphs
0 references
strongly regular graphs
0 references
Hadamard designs
0 references
Hadamard matrices
0 references
0.93296725
0 references
0.8597124
0 references
0 references
0.8475203
0 references
0.8452671
0 references
0.84425306
0 references
0.8425727
0 references
0.8425615
0 references
