Contents

Ars Combinatoria

  • Research article

Lower Bounds for Algebraic Connectivity of Graphs in Terms of Matching Number or Edge Covering Number

Jing Xu1, Yi-Zheng Fan1, Ying-Ying Tan1,2
1School of Mathematical Sciences, Anhui University, Hefei 230601, P. R. China
2School of Mathematics and Physics, Anhui Jianzhu University, Hefei 230601, P. R. China
  • Published: 31/01/2016

Abstract

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.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
Jing Xu, Yi-Zheng Fan, Ying-Ying Tan. Lower Bounds for Algebraic Connectivity of Graphs in Terms of Matching Number or Edge Covering Number[J], Ars Combinatoria, Volume 125. 361-370. .