Vertex cut, eigenvalues, [a,b]-factors and toughness of connected bipartite graphs

DOI10.1016/J.DISC.2024.114118MaRDI QIDQ6570042zbMATH OpenFDO

Authors Yifang Hao, Shuchao Li, Xuechao Li

Publication date 10 July 2024

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2024.114118

zbMATH Keywords

toughnessvertex cuteigenvalue even \([a, b\)-factor]odd \([a, b\)-factor]

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Connectivity (05C40)

Recommendations

• Factors, spectral radius and toughness in bipartite graphs
• Toughness and spectral radius in graphs
• Bipartite toughness and \(k\)-factors in bipartite graphs
• On toughness and \((g,f)\)-factors in bipartite graphs

Cites work

• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 854567 (Why is no real title available?)
• Algebraic conditions for t-tough graphs
• Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs.
• Edge-connectivity, eigenvalues, and matchings in regular graphs
• Eigenvalues and [a,b]‐factors in regular graphs
• Eigenvalues and parity factors in graphs with given minimum degree
• Eigenvalues and perfect matchings
• Interlacing eigenvalues and graphs
• Matchings in regular graphs from eigenvalues
• On a conjecture concerning spanning tree invariants and loop systems
• Regular factors and eigenvalues of regular graphs
• Regular factors of regular graphs from eigenvalues
• Regular graphs, eigenvalues and regular factors
• Spanning trees of bounded degree, connectivity, toughness, and the spectrum of a graph
• Spectra of graphs
• The factorization of graphs. II
• The spectrum and toughness of regular graphs
• Tough Ramsey graphs without short cycles
• Tough graphs and Hamiltonian circuits.
• Toughness and spectrum of a graph
• Toughness in graphs -- a survey

Cited in

(4)

• Factors, spectral radius and toughness in bipartite graphs
• Bipartite binding number, k-factor and spectral radius of bipartite graphs
• Turán-type problems on \([a, b]\)-factors of graphs, and beyond
• Toughness and signless Laplacian eigenvalues in graphs

This page was built for publication: Vertex cut, eigenvalues, \([a,b]\)-factors and toughness of connected bipartite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6570042)