Regular two-graphs on 36 vertices (Q1899427): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0024-3795(95)00158-n / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2085453715 / rank | |||
Normal rank | |||
Latest revision as of 11:29, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Regular two-graphs on 36 vertices |
scientific article |
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
