The Nordhaus-Gaddum bounds for algebraic connectivity of graphs

DOI10.3785/J.ISSN.1008-9497.2012.02.002MaRDI QIDQ4901672zbMATH OpenFDO

Authors Damei Lü, Ruihua Feng

Publication date 24 January 2013

Full work available at URL https://doi.org/10.3785/J.ISSN.1008-9497.2012.02.002

zbMATH Keywords

algebraic connectivityLaplacian spectrumNordhaus-Gaddum bound

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Recommendations

• A sharp lower bound for the algebraic connectivity of the Nordhaus-Gaddum type
• Bounds on the algebraic connectivity of graphs
• Bound for the algebraic connectivity of Nordhaus-Gaddum type for unicyclic graphs
• scientific article; zbMATH DE number 7473309
• scientific article; zbMATH DE number 2246587

Cited in

(8)

• An upper bound on the algebraic connectivity of outerplanar graphs
• The sharpness of a lower bound on the algebraic connectivity for maximal graphs
• An upper bound on algebraic connectivity of graphs with many cutpoints
• A sharp lower bound for the algebraic connectivity of the Nordhaus-Gaddum type
• Bound for the algebraic connectivity of Nordhaus-Gaddum type for unicyclic graphs
• scientific article; zbMATH DE number 7473309 (Why is no real title available?)
• Lower bounds for the algebraic connectivity of graphs with specified subgraphs
• Bounds on the algebraic connectivity of graphs

This page was built for publication: The Nordhaus-Gaddum bounds for algebraic connectivity of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4901672)