The minimum degree distance of graphs of given order and size
In this note, we study the degree distance of a graph which is a degree analogue of the Wiener index. Given n n and e e , we determine the minimum degree distance of a connected graph of order n n and size e e .
degree distance wiener index