arXiv (All)
open access
Switching graphs and designs
Switching methods can be seen as certain local transformations that do not alter their basic parameters of a combinatorial structure. Efforts have been devoted in the literature to relate and unify the switching theories for codes and designs, and also for Hadamard matrices and graphs. The combinato
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
- Flip-packability: uniform characterisations of tame graph classes#1118778
- Generating the symmetric group by three prefix reversals#820283
- Spectrally symmetric orientations of graphs#997458
- QPS-ToR: A Parallel Iterative Switching Algorithm for Reconfigurable Optical Datacenter Switching#673463
- The switching conjecture for main eigenvalues is asymptotically true#1063257
Record · ID 1033810
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