A spectral proof of the uniqueness of a strongly regular graph with parameters (81, 20, 1, 6).
Dragan StevanovicMarko MilosevicPublished in: Eur. J. Comb. (2009)
Keyphrases
- sufficient conditions
- graph structure
- expectation maximization
- graph model
- graph theory
- parameter space
- random walk
- maximum likelihood
- sensitivity analysis
- parameter values
- connected components
- theorem proving
- directed acyclic graph
- graph mining
- graph representation
- hyperspectral images
- graph theoretic
- linear logic
- spectral decomposition