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

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

REVIEW

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

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1401.2227 v1 pith:4M3KJGBD submitted 2014-01-10 math.CO

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

Jing Xu , Yi-Zheng Fan , Ying-Ying Tan This is my paper

classification math.CO

keywords numberalgebraicconnectivitycoveringedgematchingboundsgraphs

verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

0 comments

Share X Bluesky LinkedIn Reddit HN

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.

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

discussion (0)