We prove that there is a unique graph (on 81 vertices) with spectrum 201260(-7)20. We give several descriptions of this graph, and study its structure
AbstractWe show that a strongly regular graph with parameters n=57, k=14, λ=1, ν=4 ( (0,1)-eigenvalu...
We show that there is a unique graph with spectrum as in the title. It is a subgraph of the McLaughl...
We prove that there is a unique graph (on 56 vertices) with spectrum 101235(-4)20 and examine its st...
We prove that there is a unique graph (on 81 vertices) with spectrum 201260(-7)20. We give several d...
AbstractWe prove that there is a unique graph (on 81 vertices) with spectrum 201260(−7)20. We give s...
We give a new proof that there exists a unique strongly regular graph with parameters (81, 20, 1, 6)...
AbstractWe give a new proof that there exists a unique strongly regular graph with parameters (81,20...
We show the uniqueness of the strongly regular graph with parameters ¿ = 77, k = 16, ¿ = O, µ = 4 em...
Introduction. A strongly regular graph with 49 vertices and degree 16 has parameters (v, k, ¿, µ) = ...
AbstractA combinatorial construction is given of a strongly regular graph with parameters (v, k, λ, ...
We prove the non-existence of a strongly regular graph with 49 vertices and degree 16
Joint work with K. Coolsaet The McLaughlin graph [5] is a strongly regular graph on 275 vertices whi...
AbstractWe prove that there is a unique graph (on 56 vertices) with spectrum 101235(-4)20 and examin...
We show that a strongly regular graph with parameters n=57, K=14, ¿=1, ¿=4 ( (0,1)-eigenvalues: 1*14...
AbstractBy means of an exhaustive computer search we have proved that the strongly regular graphs wi...
AbstractWe show that a strongly regular graph with parameters n=57, k=14, λ=1, ν=4 ( (0,1)-eigenvalu...
We show that there is a unique graph with spectrum as in the title. It is a subgraph of the McLaughl...
We prove that there is a unique graph (on 56 vertices) with spectrum 101235(-4)20 and examine its st...
We prove that there is a unique graph (on 81 vertices) with spectrum 201260(-7)20. We give several d...
AbstractWe prove that there is a unique graph (on 81 vertices) with spectrum 201260(−7)20. We give s...
We give a new proof that there exists a unique strongly regular graph with parameters (81, 20, 1, 6)...
AbstractWe give a new proof that there exists a unique strongly regular graph with parameters (81,20...
We show the uniqueness of the strongly regular graph with parameters ¿ = 77, k = 16, ¿ = O, µ = 4 em...
Introduction. A strongly regular graph with 49 vertices and degree 16 has parameters (v, k, ¿, µ) = ...
AbstractA combinatorial construction is given of a strongly regular graph with parameters (v, k, λ, ...
We prove the non-existence of a strongly regular graph with 49 vertices and degree 16
Joint work with K. Coolsaet The McLaughlin graph [5] is a strongly regular graph on 275 vertices whi...
AbstractWe prove that there is a unique graph (on 56 vertices) with spectrum 101235(-4)20 and examin...
We show that a strongly regular graph with parameters n=57, K=14, ¿=1, ¿=4 ( (0,1)-eigenvalues: 1*14...
AbstractBy means of an exhaustive computer search we have proved that the strongly regular graphs wi...
AbstractWe show that a strongly regular graph with parameters n=57, k=14, λ=1, ν=4 ( (0,1)-eigenvalu...
We show that there is a unique graph with spectrum as in the title. It is a subgraph of the McLaughl...
We prove that there is a unique graph (on 56 vertices) with spectrum 101235(-4)20 and examine its st...
DOI
Add to ORKG