Binding number, \(k\)-factor and spectral radius of graphs
From MaRDI portal
Publication:6197802
DOI10.37236/12165OpenAlexW4391685025MaRDI QIDQ6197802
Publication date: 19 February 2024
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.37236/12165
Cites Work
- Unnamed Item
- Unnamed Item
- Best monotone degree conditions for binding number
- Large matchings from eigenvalues
- Matchings in regular graphs from eigenvalues
- A bound on the spectral radius of graphs
- Binding numbers and \(f\)-factors of graphs
- Eigenvalues and perfect matchings
- A sharp upper bound of the spectral radius of graphs
- On the spectral radius of graphs with cut edges
- Tough Ramsey graphs without short cycles
- Toughness and spectrum of a graph
- Proof of a conjecture on the spectral radius condition for \([a,b\)-factors]
- Spectral radius and \([a,b\)-factors in graphs]
- Toughness in pseudo-random graphs
- Spectral radius and matchings in graphs
- Toughness and binding number
- Perfect matchings of a graph
- Graph toughness from Laplacian eigenvalues
- Toughness, Hamiltonicity and spectral radius in graphs
- Binding Number, Minimum Degree, and Cycle Structure in Graphs
- Some Inequalities for the Largest Eigenvalue of a Graph
- On the Toughness of a Graph
- BINDING NUMBERS OF GRAPHS AND THE EXISTENCE OF k-FACTORS
- A Proof of Brouwer's Toughness Conjecture
- Sharp conditions for the existence of an even $[a,b$-factor in a graph]
- The binding number of a graph and its Anderson number
- The Factorization of Linear Graphs
- The Factors of Graphs
