| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4598831 | Linear Algebra and its Applications | 2016 | 13 Pages |
Abstract
The spectral radius of a graph is the largest eigenvalue of its adjacency matrix. P. Hansen and D. Stevanović (2008) [9] determined the graphs with maximum spectral radius among all connected graphs of order n with diameter D. In this paper, we generalize this result to k-connected graphs of order n with diameter D.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
Authors
Peng Huang, Wai Chee Shiu, Pak Kiu Sun,