A New Upper Bound for the d-dimensional Algebraic Connectivity of Arbitrary Graphs
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) ≤ a1(G), where a1(G) corresponds the well-studied second smallest eigenvalue of the graph Laplacian.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.