Neumaier graphs with few eigenvalues
| Autor: | Bart De Bruyn, Jack H. Koolen, Jozefien D'haeseleer, Aida Abiad |
|---|---|
| Přispěvatelé: | Discrete Mathematics, EAISI Foundational, Mathematics, Digital Mathematics |
| Jazyk: | angličtina |
| Rok vydání: | 2022 |
| Předmět: |
Strongly regular graph
Applied Mathematics 010102 general mathematics 0102 computer and information sciences Clique (graph theory) 01 natural sciences Graph Computer Science Applications Combinatorics Mathematics and Statistics REGULAR GRAPHS 010201 computation theory & mathematics FOS: Mathematics Mathematics - Combinatorics Edge-regular graph Regular clique Combinatorics (math.CO) 0101 mathematics Eigenvalues and eigenvectors Mathematics |
| Zdroj: | DESIGNS CODES AND CRYPTOGRAPHY Designs, Codes and Cryptography, 90(9), 2003-2019. Springer |
| ISSN: | 0925-1022 1573-7586 |
| Popis: | A Neumaier graph is a non-complete edge-regular graph containing a regular clique. In this paper we give some sufficient and necessary conditions for a Neumaier graph to be strongly regular. Further we show that there does not exist Neumaier graphs with exactly four distinct eigenvalues. We also determine the Neumaier graphs with smallest eigenvalue $$-2$$ - 2 . |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink