arXiv (All)
open access
Infinite series of Deza graphs with strongly regular children
A Deza graph is a regular graph in which the number of common neighbours of two distinct vertices takes at most two values, regardless of adjacency. Its children are the graphs on the same vertex set in which adjacency is determined by these two common-neighbour counts. A Deza graph is called strong
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
- Finding Many Overlapping Dense Subgraphs Using Triadic Cohorts#971551
- A 3-regular counterexample to the Bilu--Linial signing conjecture#1319161
- Common pairs of graphs#628826
- Long Cycles in 2-Connected Tough Graphs#1000101
- On C*-nuclearity of graph operator systems#1156947
Record · ID 1217542
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