Designs over regular graphs with least eigenvalue $$-2$$

Autor:	Rajendra M. Pawale, Ajeet Kumar Yadav, Mohan S. Shrikhande
Rok vydání:	2021
Předmět:	Combinatorics Strongly regular graph Algebra and Number Theory Linear algebra Discrete Mathematics and Combinatorics Partial classification Eigenvalues and eigenvectors Mathematics
Zdroj:	Journal of Algebraic Combinatorics. 54:1021-1045
ISSN:	1572-9192 0925-9899
DOI:	10.1007/s10801-021-01036-8
Popis:	Designs over edge-regular, co-edge-regular and amply regular graphs are investigated. Using linear algebra, we obtain lower bounds in certain inequalities involving the parameters of the designs. Some results on designs meeting the bounds are obtained. These designs are over connected regular graphs with least eigenvalue $$-2$$ , have the minimal number of blocks and do not appear in an earlier work. Partial classification such designs over strongly regular graphs with least eigenvalue $$-2$$ is given.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::919862c0ea91e9b3a53db71738638deb https://doi.org/10.1007/s10801-021-01036-8 Zobrazit plný text záznamu Full text from SpringerLink