| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4603531 | Linear Algebra and its Applications | 2007 | 6 Pages |
Abstract
Let G be a graph of order n and let be the characteristic polynomial of its Laplacian matrix. Zhou and Gutman recently proved that among all trees of order n, the kth coefficient ck is largest when the tree is a path, and is smallest for stars. A new proof and a strengthening of this result is provided. A relation to the Wiener index is discussed.
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
