Designs over regular graphs with least eigenvalue -2
DOI10.1007/S10801-021-01036-8zbMATH Open1479.05215OpenAlexW3158305273MaRDI QIDQ825523FDOQ825523
Authors: M. S. Shrikhande, Rajendra M. Pawale, Ajeet Kumar Yadav
Publication date: 17 December 2021
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10801-021-01036-8
Recommendations
strongly regular graphamply regular graphedge-regular graphHoffman boundco-edge-regular graphpartially balanced design
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Combinatorial aspects of block designs (05B05) Association schemes, strongly regular graphs (05E30) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Graph designs and isomorphic decomposition (05C51)
Cites Work
- Title not available (Why is that?)
- Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3
- Fisher's inequality for designs on regular graphs
- Exceptional graphs with smallest eigenvalue -2 and related problems
- On cliques in edge-regular graphs
- On the strong regularity of some edge-regular graphs
- On classification of two class partially balanced designs
Cited In (4)
This page was built for publication: Designs over regular graphs with least eigenvalue \(-2\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q825523)