Hai-Zhen Ren

The spanning $k$-hypertree and adjacency spectral radius in hypergraphs

The spanning $k$-tree of a connected graph is a spanning tree with a maximum degree not exceeding $k$. Hypergraphs provide a natural framework for modeling higher-order interactions. It is natural to extend the concept of spanning $k$-trees from graphs to hypergraphs. Tensor-based spectral models for hypergraphs are in...