{"paper":{"title":"On the maximal energy tree with two maximum degree vertices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jing Li, Xueliang Li, Yongtang Shi","submitted_at":"2011-03-20T10:33:57Z","abstract_excerpt":"For a simple graph $G$, the energy $E(G)$ is defined as the sum of the absolute values of all eigenvalues of its adjacent matrix. For $\\Delta\\geq 3$ and $t\\geq 3$, denote by $T_a(\\Delta,t)$ (or simply $T_a$) the tree formed from a path $P_t$ on $t$ vertices by attaching $\\Delta-1$ $P_2$'s on each end of the path $P_t$, and $T_b(\\Delta, t)$ (or simply $T_b$) the tree formed from $P_{t+2}$ by attaching $\\Delta-1$ $P_2$'s on an end of the $P_{t+2}$ and $\\Delta -2$ $P_2$'s on the vertex next to the end. In [X. Li, X. Yao, J. Zhang and I. Gutman, Maximum energy trees with two maximum degree vertice"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.3842","kind":"arxiv","version":2},"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"}