Neumaier graphs from cyclotomy with small coherent rank

Abstract

Using cyclotomy, we construct a new infinite family of Neumaier graphs that includes infinitely many strongly regular graphs. Notably, this family conjecturally contains infinitely many graphs with coherent rank 6. Our construction also provides the first known examples that answer a question posed by Evans, Goryainov, and Panasenko regarding the existence of Neumaier graphs whose nexus is not a power of 2. In addition, we show that a construction of Greaves and Koolen yields an infinite family of Neumaier graphs with coherent rank 6.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…