Article ID Journal Published Year Pages File Type
421350 Discrete Applied Mathematics 2008 4 Pages PDF
Abstract

In this note, we study the degree distance of a graph which is a degree analogue of the Wiener index. Given nn and ee, we determine the minimum degree distance of a connected graph of order nn and size ee.

Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
The minimum degree distance of graphs of given order and size
Authors
, ,