< Back to previous page
Publication
Neumaier graphs with few eigenvalues
Journal Contribution - Journal Article
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.
Journal: Des. Codes Cryptogr.
ISSN: 0925-1022
Issue: 9
Volume: 90
Pages: 2003-2019
Publication year:2021
BOF-keylabel:yes
IOF-keylabel:yes
BOF-publication weight:1
Authors:International
Authors from:Higher Education
Accessibility:Open
- See also: Neumaier graphs with few eigenvalues