arXiv (All)
open access
Neumaier graphs of coherent rank five
We construct an infinite family of Neumaier graphs of coherent rank five, answering the existence question at the smallest possible coherent rank beyond the strongly regular case. For every prime power $q\geqslant7$ with $q\equiv3\pmod4$, set $n=q+1$. Each graph in our construction has precisely fiv
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Problem 11402: Squares on Graphs#108232
- A 50-Vertex Cubic Counterexample to the Domination-versus-Edge-Domination Conjecture#997773
- Settling the total domination-annihilation conjecture for graphs with minimum degree two#1069947
- Unfriendly partitions of locally finite Borel graphs#999595
- The Strong 24-Conjecture#1071139
Record · ID 822610
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive