摘要
Let G(n)(r) be the class of all connected graphs of order n with r pendent vertices. In this paper, we determine the unique graph with minimal distance spectral radius in G(n)(r) . In addition, we determine the unique graph with maximal distance spectral radius in G(n)(r) for each r is an element of {2, 3, n - 3, n - 2, n - 1}.
- 出版日期2011-12-1