Further results regarding the degree resistance distance of cacti

preprint2015arXivOpen access

Abstract

A graph GG is called a cactus if each block of GG is either an edge or a cycle. Denote by Cact(n;t)Cact(n;t) the set of connected cacti possessing nn vertices and tt 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)Cact(n;t), and characterize the corresponding extremal graphs as well.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.