The minimum degree distance of graphs of given order and size |
| |
Authors: | Orest Bucicovschi |
| |
Affiliation: | Department of Mathematics, University of California, San Diego, La Jolla, CA 92093-0112, United States |
| |
Abstract: | In this note, we study the degree distance of a graph which is a degree analogue of the Wiener index. Given n and e, we determine the minimum degree distance of a connected graph of order n and size e. |
| |
Keywords: | Degree Distance Wiener index |
本文献已被 ScienceDirect 等数据库收录! |
|