The strongly regular (45, 12, 3, 3) graphs.
Coolsaet, Kris, Degraer, Jan, Spence, Edward (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Hadamard matrices and strongly regular graphs with the 3-e. c. adjacency property.”
The strongly regular (45, 12, 3, 3) graphs.
A matrix representation of graphs and its spectrum as a graph invariant.
Emms, David, Hancock, Edwin R., Severini, Simone, Wilson, Richard C. (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A family of nonregular distance monotone graphs
Michel Mollard (1990)
Czechoslovak Mathematical Journal
Similarity:
The strongly regular (40, 12, 2, 4) graphs.
Spence, E. (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On connected graphs with maximal index.
Cvetković, D., Rowlinson, P. (1988)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
On some regularities of graphs. II.
Zofia Majcher (1984)
Časopis pro pěstování matematiky
Similarity:
Discussing graph theory with a computer. II: Theorems suggested by the computer.
Cvetkovic, Dragos M. (1983)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Non-complete extended -sum of graphs, graph angles and star partitions.
Cvetković, Dragoš, Simić, Slobodan (1993)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity: