{"paper":{"title":"On Laplacian like energy of trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.CA","authors_text":"Aleksandar Ilic, Djordje Krtinic, Milovan Ilic","submitted_at":"2011-03-24T17:10:02Z","abstract_excerpt":"Let $G$ be a simple undirected $n$-vertex graph with the characteristic polynomial of its Laplacian matrix $L(G)$, $\\det (\\lambda I - L (G))=\\sum_{k = 0}^n (-1)^k c_k \\lambda^{n - k}$. Laplacian--like energy of a graph is newly proposed graph invariant, defined as the sum of square roots of Laplacian eigenvalues. For bipartite graphs, the Laplacian--like energy coincides with the recently defined incidence energy $IE (G)$ of a graph. In [D. Stevanovi\\' c, \\textit{Laplacian--like energy of trees}, MATCH Commun. Math. Comput. Chem. 61 (2009), 407--417.] the author introduced a partial ordering o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.4814","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"}