Eigenvalues and spanning tree in regular graphs

DOI10.1016/J.DISC.2026.115059MaRDI QIDQ6835819zbMATH OpenFDO

Authors Ao Fan, Rui-fang Liu, Jiangbo Xie

Publication date 30 March 2026

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2026.115059

zbMATH Keywords

eigenvaluesregular graphsspanning treetotal excess

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Cites work

• A sufficient condition for a graph to have a k-tree
• A tight lower bound on the matching number of graphs via Laplacian eigenvalues
• An odd \([ 1 , b ]\)-factor in regular graphs from eigenvalues
• Eigenvalues and [a,b]‐factors in regular graphs
• Eigenvalues and \([1,n]\)-odd factors
• Eigenvalues and perfect matchings
• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 3717357 (Why is no real title available?)
• Interlacing eigenvalues and graphs
• Matchings in regular graphs from eigenvalues
• Regular factors of regular graphs from eigenvalues
• Regular graphs, eigenvalues and regular factors
• Spanning trees with bounded degrees
• Spanning trees with bounded total excess.
• The Factorization of Linear Graphs
• The spanning k-trees, perfect matchings and spectral radius of graphs

This page was built for publication: Eigenvalues and spanning tree in regular graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6835819)