THE SPANNING K -HYPERTREE AND ADJACENCY SPECTRAL RADIUS IN HYPERGRAPHS ∗
Qian-Nan Niu, Haizhenren, Lei Zhang
· 0 citations
2 papers indexed here
We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.
Not the right person? Other researchers publish under this name.
Open access
Oct 2026
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...
Qian-Nan Niu, Hai-Zhen Ren, Lei Zhang
· The Electronic Journal of Li... · 0 citations