Proof of a conjecture on the spectral radius condition for \([a,b]\)-factors

DOI10.1016/j.disc.2022.113269zbMath1506.05128OpenAlexW4310286674WikidataQ123231495 ScholiaQ123231495MaRDI QIDQ2111929

Jia Wei, Sheng Gui Zhang

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

zbMATH Keywords

spectral radius\([a, b\)-factor]

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex degrees (05C07)

Related Items (1)

Binding number, \(k\)-factor and spectral radius of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Arc coverings of graphs
• Connected factors in graphs -- a survey
• A sharp upper bound of the spectral radius of graphs
• Spectral radius and \([a,b\)-factors in graphs]
• Some Inequalities for the Largest Eigenvalue of a Graph
• Factors and factorizations of graphs—a survey
• Stability number and [a,b‐factors in graphs]
• Sharp conditions for the existence of an even $[a,b$-factor in a graph]
• Subgraphs with prescribed valencies
• The Factors of Graphs

This page was built for publication: Proof of a conjecture on the spectral radius condition for \([a,b]\)-factors