Eigenvalues and [a,b]‐factors in regular graphs
From MaRDI portal
Publication:6081550
DOI10.1002/jgt.22789zbMath1522.05283OpenAlexW4200287627MaRDI QIDQ6081550
Publication date: 5 October 2023
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.22789
eigenvaluesregular graphseven \([a, b\)-factors]odd \([a, b\)-factors]
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eigenvalues, singular values, and eigenvectors (15A18)
Related Items (6)
Sharp conditions for the existence of an even $[a,b$-factor in a graph] ⋮ Two sufficient conditions for odd \([1,b\)-factors in graphs] ⋮ Eigenvalues and parity factors in graphs with given minimum degree ⋮ Characterizing \(\mathcal{P}_{\geqslant 2}\)-factor deleted graphs with respect to the size or the spectral radius ⋮ \(\mathcal{D}\)-index and \(\mathcal{Q}\)-index for spanning trees with leaf degree at most \(k\) in graphs ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sufficient condition for the existence of an even \([a,b\)-factor in graph]
- Regular factors and eigenvalues of regular graphs
- Regular factors of regular graphs from eigenvalues
- Matching and edge-connectivity in regular graphs
- Small spectral gap in the combinatorial Laplacian implies Hamiltonian
- Minimum degree of bipartite graphs and the existence of k-factors
- Eigenvalues and \([1,n\)-odd factors]
- Matchings in regular graphs from eigenvalues
- On factors with all degrees odd
- A degree condition for the existence of 1-factors in graphs or their complements
- The k-factor conjecture is true
- On regular factors in regular graphs with small radius
- Regular factors of simple regular graphs and factor-spectra
- Eigenvalues and perfect matchings
- An odd \([ 1 , b \)-factor in regular graphs from eigenvalues]
- Ore-type conditions for the existence of even \([2,b\)-factors in graphs]
- Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs
- Regular Graphs, Eigenvalues and Regular Factors
- Edge-Connectivity, Eigenvalues, and Matchings in Regular Graphs
- Toughness and the existence ofk-factors
- Regular factors of regular graphs
- Regular factors in K1,n free graphs
- A degree condition for the existence ofk-factors
- Some sufficient conditions for the existence of a 1-factor
- Independence number, connectivity, and r‐factors
- Sparse pseudo‐random graphs are Hamiltonian
- Subgraphs with prescribed valencies
- The Factorization of Linear Graphs
- On factorisation of graphs
This page was built for publication: Eigenvalues and [a,b]‐factors in regular graphs
