| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4603658 | Linear Algebra and its Applications | 2007 | 9 Pages |
Abstract
The spectral radius of a (directed) graph is the largest eigenvalue of adjacency matrix of the (directed) graph. We give the relation on the characteristic polynomials of a directed graph and its line graph, and obtain sharp bounds on the spectral radius of directed graphs. We also give the relation on the spectral radii of a graph and its line graph. As a consequence, the spectral radius of a connected graph does not exceed that of its line graph except that the graph is a path.
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
