| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4603137 | Linear Algebra and its Applications | 2009 | 6 Pages |
Abstract
Let GB(n,d) be the set of bipartite graphs with order n and diameter d. This paper characterizes the extremal graph with the maximal spectral radius in GB(n,d). Furthermore, the maximal spectral radius is a decreasing function on d. At last, bipartite graphs with the second largest spectral radius are determined.
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
