arXiv (All)
open access
A unified framework for existing and new constructions of Neumaier graphs
A Neumaier graph is a non-complete edge-regular graph containing a regular clique; it is called strictly Neumaier if it is not strongly regular. In this paper we present a construction using finite rings that unifies several known results and yields three new families, each containing infinitely man
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
- Scalable Algorithm for Dynamic Quasi-clique Detection#1144814
- AutoGraphForge: Towards Automated Graph Theory Discovery#926397
- Extremal problems for cancellative and locally thin hypergraphs#986484
- Distributed Balanced Butterfly Counting in Signed Bipartite Graphs#1036237
- Distributed Balanced Butterfly Counting in Signed Bipartite Graphs#1006817
Record · ID 1156545
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