A (49,16,3,6) strongly regular graph does not exist
A (49,16,3,6) strongly regular graph has 49 vertices, each vertex has 16 neighbours, any two adjacent vertices have three common neighbours, and any two distinct non-adjacent vertices have six common neighbours. It is proved that such a graph does not exist. The proof uses counting techniques, eigenvalues and a computer.
scientific article; zbMATH DE number 4118396