A New Upper Bound for the d-dimensional Algebraic Connectivity of Arbitrary Graphs

From MaRDI portal




Abstract: In this paper we show that the d-dimensional algebraic connectivity of an arbitrary graph G is bounded above by its 1-dimensional algebraic connectivity, i.e., ad(G)leqa1(G), where a1(G) corresponds the well-studied second smallest eigenvalue of the graph Laplacian.














This page was built for publication: A New Upper Bound for the d-dimensional Algebraic Connectivity of Arbitrary Graphs

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