Analytic connectivity of k-uniform hypergraphs
Abstract
In this paper, we study the analytic connectivity of a k-uniform hypergraph H, denoted by α(H). In addition to computing the analytic connectivity of a complete k-graph, we present several bounds on analytic connectivity that relate it with other graph invariants, such as degree, vertex connectivity, diameter, and isoperimetric number.
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.