Lower bounds for algebraic connectivity of graphs in terms of matching number or edge covering number

zbMath1413.05209arXiv1401.2227MaRDI QIDQ2828965

Ying-Ying Tan, Jing Xu, Yi-Zheng Fan

Publication date: 26 October 2016

Full work available at URL: https://arxiv.org/abs/1401.2227

zbMATH Keywords

graphmatching numberalgebraic connectivityedge covering number

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)

Related Items (2)

A lower bound for the algebraic connectivity of a graph in terms of the domination number ⋮ Hamiltonian graphs of given order and minimum algebraic connectivity

This page was built for publication: Lower bounds for algebraic connectivity of graphs in terms of matching number or edge covering number