{"paper":{"title":"Uniform hypergraphs with the first two smallest spectral radii","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.SP","authors_text":"Haiyan Guo, Jianbin Zhang, Jianping Li","submitted_at":"2018-08-26T16:46:16Z","abstract_excerpt":"The spectral radius of a uniform hypergraph $G$ is the the maximum modulus of the eigenvalues of the adjacency tensor of $G$. For $k\\ge 2$, among connected $k$-uniform hypergraphs with $m\\ge 1$ edges, we show that the $k$-uniform loose path with $m$ edges is the unique one with minimum spectral radius, and we also determine the unique ones with second minimum spectral radius when $m\\ge 2$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.08590","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}