| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4650882 | Discrete Mathematics | 2008 | 7 Pages |
Abstract
The index of a graph is the largest eigenvalue of its adjacency matrix. Among the trees with a fixed order and diameter, a graph with the maximal index is a caterpillar. In the set of caterpillars with a fixed order and diameter, or with a fixed degree sequence, we identify those whose index is maximal.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Slobodan K. Simić, Enzo Maria Li Marzi, Francesco Belardo,