Factors, spectral radius and toughness in bipartite graphs
From MaRDI portal
Publication:6559405
DOI10.1016/J.DAM.2024.05.008zbMATH Open1543.05107MaRDI QIDQ6559405
Huiqiu Lin, Yuanyuan Chen, Dandan Fan
Publication date: 21 June 2024
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On toughness and \((g,f)\)-factors in bipartite graphs
- Bipartite toughness and \(k\)-factors in bipartite graphs
- Toughness and the existence of k-factors. II
- Toughness and the existence of \(k\)-factors. III
- On the spectral radius of graphs with cut edges
- Tough Ramsey graphs without short cycles
- Toughness and spectrum of a graph
- Tough graphs and Hamiltonian circuits.
- Toughness, Hamiltonicity and spectral radius in graphs
- Toughness and the existence ofk-factors
- A Proof of Brouwer's Toughness Conjecture
This page was built for publication: Factors, spectral radius and toughness in bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6559405)
