{"paper":{"title":"The maximum degree resistance distance of cacti","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jia-Bao Liu, Xiang-Feng Pan","submitted_at":"2015-11-15T14:27:18Z","abstract_excerpt":"Various topological indices, based on the distances between the vertices of a graph, are widely used in theoretical chemistry. The degree resistance distance of a graph $G$ is defined as ${D_R}(G) = \\sum\\limits_{\\{u,v\\} \\subseteq V(G)} {[d(u) + d(v)]R(u,v)},$ where $d(u)$ is the degree of the vertex $u,$ and $R(u, v)$ the resistance distance between the vertices $u$ and $v.$\n  A graph $G$ is called a cactus if each block of $G$ is either an edge or a cycle. In this paper, we completely characterize the extremal cacti having the maximum degree resistance distance among all cacti with $n$ vertic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.04704","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"}