期刊文献+

第二大特征值在(1,2^(1/2))的单圈图的刻画

On Unicyclic Graphs Whose Second Largest Eigenvalue is in(1,2^(1/2))
原文传递
导出
摘要 边数和顶点数相等的连通图称为单圈图,确定了第二大特征值在(1,2^(1/2))的所有单圈图. Connected graphs in which the number of edges equals the number of vertices are called unicyclic graphs. In this paper, all unicyclic graphs whose second largest eigenvalueis in (1,/2) have been determined.
出处 《应用数学学报》 CSCD 北大核心 2015年第4期610-618,共9页 Acta Mathematicae Applicatae Sinica
基金 国家自然科学基金(11101232,11161037)资助项目
关键词 单圈图 特征值 围长 禁用子图 unicyclic graph eigenvalue girth forbidden subgraph
  • 相关文献

参考文献8

  • 1Cvetkovic D. On gaphs whose second largest eigenvalue does not exceed 1. Publ. Inst. Math (Beograd), 1982, 31(45): 15-20.
  • 2Cvetkovic D, Doob, M, Sachs, H. Spectra of Graphs. New York: Academic Press, 1980.
  • 3Guo S H. On bicyclic graphs whose second largest eigenvalue does not exceed 1. Linear Algebra Appl., 2005, 407:201-210.
  • 4Hong, Y. Sharp lower bounds on the eigenvalues of trees. Linear Algebra Appl., 1989, 1133:101-105.
  • 5Shu J L. On trees whose second largest eigenvalue does not exceed 1. OR. Tranks, 1998, 2(3): 6-9.
  • 6Shu J L. On trees whose second largest eigenvalue does not exceed √2. G. Journal of East China Normal University (Natural Science). 1999, No.4.
  • 7Stanic Z. Some graphs whose second largest eigenvalue does not exceed √2. Linear Algebra Appl., 2012, 437:1812-1820.
  • 8Xu G H. On unicyclic graphs whose second largest eigenvalue does not exceed 1. Discrete Applied Mathematics, 2004, 136:117-124.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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