Non-existence of (76,30,8,14) strongly regular graph and some structural tools

@article{Bondarenko2014NonexistenceO,
  title={Non-existence of (76,30,8,14) strongly regular graph and some structural tools},
  author={A. Bondarenko and A. Prymak and D. Radchenko},
  journal={arXiv: Combinatorics},
  year={2014}
}
  • A. Bondarenko, A. Prymak, D. Radchenko
  • Published 2014
  • Mathematics
  • arXiv: Combinatorics
  • Our main result is the non-existence of strongly regular graph with parameters (76,30,8,14). We heavily use Euclidean representation of a strongly regular graph, and develop a number of tools that allow to establish certain structural properties of the graph. In particular, we give a new lower bound for the number of 4-cliques in a strongly regular graph. 
    There is no (75,32,10,16) strongly regular graph
    16
    There is no (95,40,12,20) strongly regular graph
    16
    Necessary and sufficient conditions for quasi-strongly regularity of Graph Product
    Distance-regular graphs without 4-claws
    1
    Jernej Azarija Some Results From Algebraic Graph Theory
    There are no 76 equiangular lines in $R^{19}$
    8

    References

    Publications referenced by this paper.
    SHOWING 1-9 OF 9 REFERENCES
    Strongly regular graphs
    164
    Algorithm 457: finding all cliques of an undirected graph
    1812
    Spectra of Graphs
    1474
    Isomorph-free exhaustive generation algorithms for association schemes
    • 2007
    Positive definite functions on spheres
    395
    Springer
    • 2012