Lower bounds for algebraic connectivity of graphs in terms of matching number or edge covering number
classification
🧮 math.CO
keywords
numberalgebraicconnectivitycoveringedgematchingboundsgraphs
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.