Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs

详细信息    查看全文

• 作者：Sebastian M. Cioabă ; Xiaofeng Gu
• 关键词：spectral graph theory ; eigenvalue ; connectivity ; toughness ; spanning k ; tree
• 刊名：Czechoslovak Mathematical Journal
• 出版年：2016
• 出版时间：September 2016
• 年：2016
• 卷：66
• 期：3
• 页码：913-924
• 全文大小：171 KB
• 刊物类别：Mathematics and Statistics
• 刊物主题：Mathematics
  Mathematics
  Analysis
  Convex and Discrete Geometry
  Ordinary Differential Equations
  Mathematical Modeling and IndustrialMathematics
  
• 出版者：Springer Netherlands
• ISSN：1572-9141
• 卷排序：66

文摘

The eigenvalues of graphs are related to many of its combinatorial properties. In his fundamental work, Fiedler showed the close connections between the Laplacian eigenvalues and eigenvectors of a graph and its vertex-connectivity and edge-connectivity.