On the reciprocal degree distance of graphs with cut vertices or edges
arXiv:1503.03205
Abstract
In this paper, the extremal graph with the maximum RRD-value among all the graphs of order n with given cut vertices or edges is characterized. In addition, an upper bounds on the reciprocal degree distance in terms of the number of cut edges is provided.
12 pages, 4 figures