Binary codes of strongly regular graphs (Q1963158): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / reviewed by | |||
| Property / reviewed by: Patric R. J. Östergård / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Patric R. J. Östergård / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1023/a:1026479210284 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1535329300 / rank | |||
Normal rank | |||
Latest revision as of 10:09, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Binary codes of strongly regular graphs |
scientific article |
Statements
Binary codes of strongly regular graphs (English)
0 references
24 January 2000
0 references
The binary code of a graph is the linear code generated by the rows of the adjacency matrix of the graph. The authors investigate, with the exception of two parameter sets, the codes from known strongly regular graphs with fewer than 45 vertices. They also consider the codes obtained when the main diagonal of the adjacency matrix is the all-one vector. For the codes, the dimension and the weight enumerator are determined using a computer and tabulated; isomorphic codes are also indicated. Several general results for codes of (various types of) strongly regular graphs are proved.
0 references
adjacency matrix
0 references
code of graph
0 references
linear code
0 references
rank
0 references
regular two-graph
0 references
strongly regular graph
0 references
