On strongly regular graph with parameters (65; 32; 15; 16)

Abstract

We construct a strongly regular graph with the parameters (65; 32; 15; 16). The idea is to search for an adjacency matrix that consists of circulant blocks. Equations with such matrices can be reduced to congruences with polynomials matrices of smaller orders. We can consider these congruences over different moduli for a more efficient computational approach.