Proof of a conjecture on the spectral radius condition for [a,b]-factors
From MaRDI portal
Publication:2111929
DOI10.1016/J.DISC.2022.113269zbMATH Open1506.05128OpenAlexW4310286674WikidataQ123231495 ScholiaQ123231495MaRDI QIDQ2111929FDOQ2111929
Publication date: 17 January 2023
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2022.113269
Recommendations
spectral radius\([a, b\)-factor]
Cites Work
- Title not available (Why is that?)
- A sharp upper bound of the spectral radius of graphs
- Some Inequalities for the Largest Eigenvalue of a Graph
- Title not available (Why is that?)
- Stability number and [a,b]‐factors in graphs
- Factors and factorizations of graphs—a survey
- The Factors of Graphs
- Subgraphs with prescribed valencies
- Connected factors in graphs -- a survey
- Arc coverings of graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Spectral radius and \([a,b]\)-factors in graphs
- Sharp conditions for the existence of an even $[a,b]$-factor in a graph
Cited In (6)
- A spectral proof of Rademacher's conjecture for congruence subgroups of the modular group.
- Turán-type problems on \([a, b]\)-factors of graphs, and beyond
- The \(A_{\alpha}\)-spectral radius and \([a,b]\)-factors in graphs
- Perfect integer \(k\)-matching, \(k\)-factor-critical, and the spectral radius of graphs
- Binding number, \(k\)-factor and spectral radius of graphs
- Some remarks on upper bounds for Weierstrass primary factors and their application in spectral theory
This page was built for publication: Proof of a conjecture on the spectral radius condition for \([a,b]\)-factors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2111929)