Designs over regular graphs with least eigenvalue \(-2\)

DOI10.1007/S10801-021-01036-8zbMath1479.05215OpenAlexW3158305273MaRDI QIDQ825523

Mohan 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

zbMATH Keywords

strongly regular graphHoffman boundamply regular graphedge-regular graphco-edge-regular graphpartially balanced design

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Association schemes, strongly regular graphs (05E30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph designs and isomorphic decomposition (05C51)

Cites Work

• Unnamed Item
• On cliques in edge-regular graphs
• Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3
• Exceptional graphs with smallest eigenvalue -2 and related problems
• On the strong regularity of some edge-regular graphs
• On classification of two class partially balanced designs
• Fisher's inequality for designs on regular graphs

This page was built for publication: Designs over regular graphs with least eigenvalue \(-2\)