Proof of a conjecture on the spectral radius condition for [a,b]-factors
From MaRDI portal
Publication:2111929
spectral radius\([a, b\)-factor]
Recommendations
Cites work
- scientific article; zbMATH DE number 3760340 (Why is no real title available?)
- scientific article; zbMATH DE number 109208 (Why is no real title available?)
- scientific article; zbMATH DE number 500491 (Why is no real title available?)
- A sharp upper bound of the spectral radius of graphs
- Arc coverings of graphs
- Connected factors in graphs -- a survey
- Factors and factorizations of graphs—a survey
- Graph theory
- Sharp conditions for the existence of an even \([a,b]\)-factor in a graph
- Some Inequalities for the Largest Eigenvalue of a Graph
- Spectral radius and \([a,b]\)-factors in graphs
- Stability number and [a,b]‐factors in graphs
- Subgraphs with prescribed valencies
- The Factors of Graphs
Cited in
(21)- A spectral proof of Rademacher's conjecture for congruence subgroups of the modular group.
- Sufficient conditions for k-factors and spanning trees of graphs
- Spectral extremal problems on factors in tough graphs, and beyond
- Bipartite binding number, k-factor and spectral radius of bipartite graphs
- Spectral radius and fractional \([a, b]\)-factor of graphs
- 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
- Spectral condition for k-factor-criticality in t-connected graphs
- \(A_\alpha\)-spectral conditions for \((a, b, k)\)-factor-critical graphs and fractional \(ID\)-\([a, b]\)-factor-critical covered graphs
- Signless Laplacian spectral conditions for \(k\)-critical graphs with respect to \([1, b]\)-odd factors
- Spectral radius, the matching number and fractional criticality of graphs
- Some remarks on upper bounds for Weierstrass primary factors and their application in spectral theory
- Distance spectral conditions for \textit{ID}-factor-criticality and fractional \([a,b]\)-factor of graphs
- Spectral extremal problem on all (a, b, k)-critical graphs
- Characterizations of fractional factor-critical graphs via size and spectral radius
- A note on the spectral radius and \([a,b]\)-factor of graphs
- Spectral conditions for graphs to contain k-factors
- A spectral condition for Hamilton cycles in tough bipartite graphs
- Spectral radius and \([a,b]\)-factors in graphs
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)