The geometry connectivity of hypergraphs

From MaRDI portal




Abstract: Let mathcalG be a k-uniform hypergraph, mathcalLmathcalG be its Laplacian tensor. And denotes the maximum number of linearly independent nonnegative eigenvectors of mathcalLmathcalG corresponding to the eigenvalue 0. In this paper, is called the geometry connectivity of mathcalG. We show that the number of connected components of mathcalG equals the geometry connectivity .











This page was built for publication: The geometry connectivity of hypergraphs

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