- Author
- Aida Abiad (UGent) , Bart De Bruyn (UGent) , Jozefien D'haeseleer (UGent) and Jack H. Koolen
- Organization
- Abstract
- 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.
- Keywords
- Applied Mathematics, Computer Science Applications, Edge-regular graph, Regular clique, Strongly regular graph, REGULAR GRAPHS
Downloads
-
published.pdf
- full text (Published version)
- |
- open access
- |
- |
- 335.33 KB
Citation
Please use this url to cite or link to this publication: http://hdl.handle.net/1854/LU-8712520
- MLA
- Abiad, Aida, et al. “Neumaier Graphs with Few Eigenvalues.” DESIGNS CODES AND CRYPTOGRAPHY, vol. 90, no. 9, 2022, pp. 2003–19, doi:10.1007/s10623-021-00856-w.
- APA
- Abiad, A., De Bruyn, B., D’haeseleer, J., & Koolen, J. H. (2022). Neumaier graphs with few eigenvalues. DESIGNS CODES AND CRYPTOGRAPHY, 90(9), 2003–2019. https://doi.org/10.1007/s10623-021-00856-w
- Chicago author-date
- Abiad, Aida, Bart De Bruyn, Jozefien D’haeseleer, and Jack H. Koolen. 2022. “Neumaier Graphs with Few Eigenvalues.” DESIGNS CODES AND CRYPTOGRAPHY 90 (9): 2003–19. https://doi.org/10.1007/s10623-021-00856-w.
- Chicago author-date (all authors)
- Abiad, Aida, Bart De Bruyn, Jozefien D’haeseleer, and Jack H. Koolen. 2022. “Neumaier Graphs with Few Eigenvalues.” DESIGNS CODES AND CRYPTOGRAPHY 90 (9): 2003–2019. doi:10.1007/s10623-021-00856-w.
- Vancouver
- 1.Abiad A, De Bruyn B, D’haeseleer J, Koolen JH. Neumaier graphs with few eigenvalues. DESIGNS CODES AND CRYPTOGRAPHY. 2022;90(9):2003–19.
- IEEE
- [1]A. Abiad, B. De Bruyn, J. D’haeseleer, and J. H. Koolen, “Neumaier graphs with few eigenvalues,” DESIGNS CODES AND CRYPTOGRAPHY, vol. 90, no. 9, pp. 2003–2019, 2022.
@article{8712520,
abstract = {{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.}},
author = {{Abiad, Aida and De Bruyn, Bart and D'haeseleer, Jozefien and Koolen, Jack H.}},
issn = {{0925-1022}},
journal = {{DESIGNS CODES AND CRYPTOGRAPHY}},
keywords = {{Applied Mathematics,Computer Science Applications,Edge-regular graph,Regular clique,Strongly regular graph,REGULAR GRAPHS}},
language = {{eng}},
number = {{9}},
pages = {{2003--2019}},
title = {{Neumaier graphs with few eigenvalues}},
url = {{http://doi.org/10.1007/s10623-021-00856-w}},
volume = {{90}},
year = {{2022}},
}
- Altmetric
- View in Altmetric
- Web of Science
- Times cited: