{"paper":{"title":"Further results regarding the degree resistance distance of cacti","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.SP"],"primary_cat":"math.CO","authors_text":"Jia-Bao Liu, Wen-Rui Wang, Xiang-Feng Pan, Yong-Ming Zhang","submitted_at":"2015-05-18T05:17:50Z","abstract_excerpt":"A graph $G$ is called a cactus if each block of $G$ is either an edge or a cycle. Denote by $Cact(n;t)$ the set of connected cacti possessing $n$ vertices and $t$ cycles. In this paper, we show that there are some errors in [J. Du, G. Su, J. Tu, I. Gutman, The degree resistance distance of cacti, Discrete Appl. Math. 188 (2015) 16-24.], and we present some results which correct their mistakes. We also give the second-minimum and third-minimum degree resistance distances among graphs in $Cact(n;t)$, and characterize the corresponding extremal graphs as well."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.05496","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"}