Affordable Access

Access to the full text

Neumaier graphs with few eigenvalues

Authors
  • Abiad, Aida
  • De Bruyn, Bart
  • D'haeseleer, Jozefien
  • Koolen, Jack H.
Publication Date
Jan 01, 2021
Identifiers
DOI: 10.1007/s10623-021-00856-w
OAI: oai:archive.ugent.be:8712520
Source
Ghent University Institutional Archive
Keywords
Language
English
License
Green
External links

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.

Report this publication

Statistics

Seen <100 times