arXiv (All)
open access
Resolutions of two conjectures on the spectral diameter
Let lambda_1(G) >= lambda_2(G) >= ... >= lambda_n(G) be the adjacency spectrum of a graph G on n vertices. The spectral distance sigma(G,H) between n-vertex graphs G and H is the Manhattan distance between their spectra, i.e., sigma(G,H) = sum_{i=1}^n |lambda_i(G) - lambda_i(H)|. Given a set G of pa
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
- The Laplacian $S_{n,n}$ conjecture is true#1063106
- On the graph of the dimension function of the Lagrange and Markov spectra#160777
- dlexDB Lemmas: Frequency absolute#929556
- Dimension spectrum of digit frequency sets for beta-expansions#1110177
- Multiplicativity of the weak Haagerup constant#1129808
Record · ID 1077560
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