| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4602454 | Linear Algebra and its Applications | 2009 | 8 Pages |
Abstract
Let B(n,g) be the set of bicyclic graphs on n vertices with girth g. In this paper, we determine the unique graph with the maximal spectral radius among all graphs in B(n,g). Moreover, the maximal spectral radius is a decreasing function on g.
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
