An infinite class of Neumaier graphs and non-existence results

E-resources

Peer reviewed Open access

An infinite class of Neumaier graphs and non-existence results

Abiad, Aida; Castryck, Wouter; De Boeck, Maarten; Koolen, Jack H.; Zeijlemaker, Sjanne

Journal of combinatorial theory. Series A, January 2023, 2023-01-00, Volume: 193

Journal Article

A Neumaier graph is a non-complete edge-regular graph containing a regular clique. A Neumaier graph that is not strongly regular is called a strictly Neumaier graph. In this work we present a new construction of strictly Neumaier graphs, and using Jacobi sums, we show that our construction produces infinitely many instances. Moreover, we prove some necessary conditions for the existence of (strictly) Neumaier graphs that allow us to show that several parameter sets are not admissible.

Keep searching

Author

Abiad, Aida | Castryck, Wouter | De Boeck, Maarten | Koolen, Jack H. | Zeijlemaker, Sjanne

Access to the JCR database is permitted only to users from Slovenia. Your current IP address is not on the list of IP addresses with access permission, and authentication with the relevant AAI accout is required.

Year	Impact factor		Edition		Category		Classification
Year	JCR	SNIP	JCR	SNIP	JCR	SNIP	JCR	SNIP

Links to authors' personal bibliographies	Links to information on researchers in the SICRIS system

Source: Personal bibliographies and: SICRIS

Upload image

Shelf entry

Adding material to shelf was successful.

Adding material to shelf failed.

It was not necessary to add the material to the shelf.

Permalink

E-mail

Impact factor

Select the library membership card:

DRS, in which the journal is indexed

Citations

Theme