On the Largest Eigenvalue of the Distance Matrix of a Tree

Abstract

The largest eigenvalue Λ1 of the distance matrix of a tree has been proposed as a structure–descriptor. We provide upper and lower bounds for Λ1 in terms of the number of vertices, the sum of the squares of the distances between all unordered pairs of vertices, or the Wiener index of the tree. INTRODUCTION Let G be a connected graph with vertex set {1, 2… (More)

Topics

Statistics

051015201520162017
Citations per Year

Citation Velocity: 5

Averaging 5 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.
  • Presentations referencing similar topics