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

In this paper we characterize the unique graph whose algebraic connectivity is minimum among all connected graphs with given order and fixed matching number or edge covering number, and present two lower bounds for the algebraic connectivity in terms of the matching number or edge covering number.Comment: arXiv admin note: substantial text overlap with arXiv:1310.853