Further results regarding the degree resistance distance of cacti

Jia-Bao Liu, Wen-Rui Wang, Yong-Ming Zhang +1

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 p…