| The spectral radii of a graph and its line graph | |
| Shi, Lingsheng | |
| 2010-05-06 ; 2010-05-06 | |
| 关键词 | spectral radius line graph characteristic polynomial Mathematics, Applied |
| 中文摘要 | 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. (c) 2006 Elsevier Inc. All rights reserved. |
| 语种 | 英语 ; 英语 |
| 出版者 | ELSEVIER SCIENCE INC ; NEW YORK ; 360 PARK AVE SOUTH, NEW YORK, NY 10010-1710 USA |
| 内容类型 | 期刊论文 |
| 源URL | [http://hdl.handle.net/123456789/14194]  |
| 专题 | 清华大学 |
| 推荐引用方式 GB/T 7714 | Shi, Lingsheng. The spectral radii of a graph and its line graph[J],2010, 2010. |
| APA | Shi, Lingsheng.(2010).The spectral radii of a graph and its line graph.. |
| MLA | Shi, Lingsheng."The spectral radii of a graph and its line graph".(2010). |
| 个性服务 |
| 查看访问统计 |
| 相关权益政策 |
| 暂无数据 |
| 收藏/分享 |
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。
修改评论