| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4603593 | Linear Algebra and its Applications | 2007 | 9 Pages |
Abstract
We consider two classes of graphs: (i) trees of order n and diameter d =n − 3 and (ii) unicyclic graphs of order n and girth g = n − 2. Assuming that each graph within these classes has two vertices of degree 3 at distance k, we order by the index (i.e. spectral radius) the graphs from (i) for any fixed k (1 ⩽ k ⩽ d − 2), and the graphs from (ii) independently of k.
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
