English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

A graph $G$ is called a cactus if each block of $G$ is either an edge or acycle. Denote by $Cact(n;t)$ the set of connected cacti possessing $n$ verticesand $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 theirmistakes. We also give the second-minimum and third-minimum degree resistancedistances among graphs in $Cact(n;t)$, and characterize the correspondingextremal graphs as well.

Further results regarding the degree resistance distance of cacti