The least H-eigenvalue of adjacency tensor of hypergraphs with cut vertices

18 Feb 2020 Fan Yi-Zheng Zhu Zhu Wang Yi

Let $G$ be a connected hypergraph with even uniformity, which contains cut vertices. Then $G$ is the coalescence of two nontrivial connected sub-hypergraphs (called branches) at a cut vertex... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • COMBINATORICS