Regular factors of regular graphs from eigenvalues

zbMath1204.05057arXiv1003.1785MaRDI QIDQ612943

Hongliang Lu

Publication date: 16 December 2010

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1003.1785

zbMATH Keywords

lower boundsecond largest eigenvaluethird largest eigenvaluebest upper bound

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (10)

Spectral radius and \([a,b\)-factors in graphs] ⋮ Sharp conditions for the existence of an even $[a,b$-factor in a graph] ⋮ Regular factors and eigenvalues of regular graphs ⋮ Eigenvalues and [a,b‐factors in regular graphs] ⋮ Eigenvalues and parity factors in graphs with given minimum degree ⋮ Graph toughness from Laplacian eigenvalues ⋮ Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs ⋮ A tight lower bound on the matching number of graphs via Laplacian eigenvalues ⋮ Hamiltonian \(s\)-properties and eigenvalues of \(k\)-connected graphs ⋮ The spectral radius and \({\mathcal{P}}_{\ge \ell}\)-factors of graphs involving minimum degree

This page was built for publication: Regular factors of regular graphs from eigenvalues