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

DOI10.1016/J.DISC.2024.114118zbMATH Open1543.05098MaRDI QIDQ6570042

Yifang Hao, Shuchao Li, Xuechao Li

Publication date: 10 July 2024

Published in: Discrete Mathematics (Search for Journal in Brave)

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)

Cites Work

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

Cited In (1)

• Turán-type problems on \([a, b]\)-factors of graphs, and beyond

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)