The spanning $k$-hypertree and adjacency spectral radius in hypergraphs
The Electronic Journal of Linear Algebra · 23.10.2026 · 42 · 794-808
DOI: 10.13001/ela.2026.9717 ↗Kurz gefasst
Fachartikel in der Zeitschrift The Electronic Journal of Linear Algebra, online erschienen am 23.10.2026. Verfasst von Qianan Niu und 2 weiteren Autor:innen.
Abstract (Originalsprache)
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 inherently higher-order and nonlinear, while Banerjee [Linear Algebra and its Applications, 614 (2021) 82-110] proposed a novel adjacency matrix $A(H)$ for general hypergraphs, whose matrix-based representation preserves typical graph-like spectral features, including the correspondence between row sums and vertex degrees. For the existence of spanning $k$-trees in graphs, authors typically use quotient matrices as tools to achieve expected results. Due to the complex structure of the entropy matrix in hypergraphs. In this paper, by means of a different approach, we establish a relationship between adjacency spectral condition on $A(H)$ and the existence of spanning $k$-hypertree for hypergraph $H$ and verify a sharp lower bound on adjacency spectral radius to guarantee the existence of spanning $k$-hypertrees in uniform hypergraphs.
Zitieren
APA
Niu, Q., Ren, H., & Zhang, L. (2026). The spanning $k$-hypertree and adjacency spectral radius in hypergraphs. The Electronic Journal of Linear Algebra, 42, 794-808. https://doi.org/10.13001/ela.2026.9717
Vancouver
Niu Q, Ren H, Zhang L. The spanning $k$-hypertree and adjacency spectral radius in hypergraphs. The Electronic Journal of Linear Algebra. 2026;42:794-808. doi:10.13001/ela.2026.9717
BibTeX
@article{Niu2026,
author = {Niu, Qianan and Ren, Haizhen and Zhang, Lei},
title = {The spanning $k$-hypertree and adjacency spectral radius in hypergraphs},
journal = {The Electronic Journal of Linear Algebra},
year = {2026},
volume = {42},
pages = {794--808},
doi = {10.13001/ela.2026.9717}
}
EUVIMED