Work

Neumaier graphs with few eigenvalues

Year: 2020

Type: preprint

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.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.2007.07520

Authors: Abiad, Aida, De Bruyn, Bart, D'haeseleer, Jozefien, Koolen, Jack H.

Institutions: Eindhoven University of Technology, University of Science and Technology of China, Ghent University

Language: English

Topic: Finite Group Theory Research

Subfield: Discrete Mathematics and Combinatorics

Field: Mathematics

Domain: Physical Sciences

Open Access status: green

Funders: National Natural Science Foundation of China, Fonds Wetenschappelijk Onderzoek, Universiteit Gent, Vlaamse regering, Bijzonder Onderzoeksfonds UGent

Awards: G5718095070, G7532343428

OpenAlex ID: W3043209652

Cites: 9

Cited by:

Related to: 10