期刊文献+

图的第四大无符号拉普拉斯特征值的一个下界(英文)

A Lower Bound on the Forth Largest Signless Laplacian Eigenvalue of Graphs
在线阅读 下载PDF
导出
摘要 设G是一个阶数大于等于4的简单连通图.K_4(G)和d_4(G)分别表示G的第四大无符号拉普拉斯特征值和第四大度.本文证明了k_4(G)≥d_4(G)—2. Let G be a simple connected graph with order n ≥ 4. Denote by K4(G) and d4(G) the forth largest sign[ess Laplacian eigenvalue and the forth largest degree of G, respectively. This note shows that K4(G) ≥d4(G) - 2.
出处 《数学研究》 CSCD 2012年第1期9-15,共7页 Journal of Mathematical Study
基金 supported by NSFC(10971198,11126258) the Natural Science Foundation of Zhejiang Province(26090150) the Scientific Research Fund of Zhejiang Provincial Education Department(Y201120835)
关键词 无符号拉普拉斯特征值 下界 Signless Laplacian Eigenvalue Lower bound Degree
  • 相关文献

参考文献9

  • 1Cvetkovic D.,Rowlinson P.,Simic S.K..Eigenvalue bounds for the signless Laplacian. Publ.Inst.Math..2007,81(95):11-27.
  • 2Das.K.Ch..On conjectures involving second largest signless Laplacian eigenvalue of graphs.Linear Algebra Appl.,2010,432:3018-3029.
  • 3Wang J.,Belardo F..A note on the signless Laplacian eigenvalues of graphs.Linear Algebra Appl.,2011,435:2585-2590.
  • 4Cvetkovic D.,Rowlinson P.,Simic S.K..Signless Laplacian of finite graphs.Linear Algebra Appl.,2007,423:155-171.
  • 5Cvetkovic D.,Simic S.K..Towards a spectral theory of Graphs based on signless LaplacianⅠ.Publ.Inst.Math.,2009,85(99):19-33.
  • 6Cvetkovic D.,Simic S.K..Towards a spectral theory of Graphs based on signless LaplacianⅡ.Linear Algebra Appl,2010,432:2257-2272.
  • 7Cvetkovic D.,Simic S.K..Towards a spectral theory of Graphs based on signless LaplacianⅢ.Appl.Anal.Discrete Math.,2010,4:156-166.
  • 8Haemers W.H..Interlacing Eigenvalues and Graphs.Linear Algebra Appl.,1995, 227-228:593-616.
  • 9Horn R.A.,Johnson C.R..Matrix analysis.Cambridge,Cambridge University Press, 1985.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部