首页 | 本学科首页   官方微博 | 高级检索  
     检索      

图和线图的谱性质
引用本文:陈晏.图和线图的谱性质[J].高校应用数学学报(英文版),2002,17(3):371-376.
作者姓名:陈晏
作者单位:Dept.ofMath.,ZhejiangEducationInstitute,Hangzhou310012,China
摘    要:Let G be a simple connected graph with n vertices and m edges,Lo be the line graph of G and λ1(LG)≥λ2 (LG)≥...≥λm(LG) be the eigenvalues of the graph LG,.. In this paper, the range of eigenvalues of a line graph is considered. Some sharp upper bounds and sharp lower bounds of the eigenvalues of Lc. are obtained. In oarticular,it is oroved that-2cos(π/n)≤λn-1(LG)≤n-4 and λn(LG)=-2 if and only if G is bipartite.

关 键 词:  线图    性质
收稿时间:28 December 2001

Properties of spectra of graphs and line graphs
Chen Yan.Properties of spectra of graphs and line graphs[J].Applied Mathematics A Journal of Chinese Universities,2002,17(3):371-376.
Authors:Chen Yan
Institution:(1) Dept. of Math., Zhejiang Education Institute, 310012 Hangzhou, China
Abstract:Let G be a simple connected graph with n vertices and m edges, L G be the line graph of G and λ 1 (L G ) ≥ λ 2 (L G ) ≥ … ≥ λ m (L G ) be the eigenvalues of the graph L G . In this paper, the range of eigenvalues of a line graph is considered. Some sharp upper bounds and sharp lower bounds of the eigenvalues of L G are obtained. In particular, it is proved that and λ n (L G ) =−2 if and only if G is bipartite.
Keywords:eigenvalue  line graph  Laplacian matrix  
本文献已被 CNKI 维普 万方数据 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号