arXiv (All)
open access
A finite threshold for the double-comet conjecture
For a tree $T$, let $g(T)=λ_1(T)-λ_2(T)$ be the difference between its two largest adjacency eigenvalues. A balanced double comet is obtained by attaching equally many leaves to the two endpoints of a path. Jovović, Koledin and Stanić conjectured that such a tree attains the minimum adjacency spectr
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 Richelot isogeny graph and paramodular forms of weight 3: Atkin-Lehner signs and certified spectra#1356155
- Blue-tilted spectral running and the JWST early galaxy tension#821875
- Reconstruction and Symmetry of Two-Token Graphs#1324736
- Spawn of the Comet#44474
- Computation of the one-loop spectral QCD running coupling using covariant spectral regularization#1132429
Record · ID 1187591
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