arXiv (All)
open access
Orthogonal signed graphs of degree 5
An orthogonal signed graph is a connected signed graph whose signed adjacency matrix has pairwise orthogonal rows. They are closely related to Hadamard matrices, maximal arrangements of equiangular lines, bipartite Ramanujan graphs, and the remarkable resolution of the Sensitivity Conjecture. Orthog
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
- Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming#819229
- Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming#809237
- A structure theory for signed graphs with fixed smallest eigenvalue#677502
- A structure theory for signed graphs with fixed smallest eigenvalue#674304
- The switching conjecture for main eigenvalues is asymptotically true#1063257
Record · ID 986378
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