Sufficient Conditions for Spanning k-Hypertrees via Distance Spectral Radius of Hypergraphs

Qiannan Niu, Jinyu Zou, Lei Zhang and Haizhen Ren

Journal of Mathematics, 2026, vol. 2026, 1-11

Abstract: For an integer k≥2, a spanning k-hypertree T is defined as a spanning hypertree (β-acyclic) such that the maximum degree dTv of every vertex v∈VT is at most k. A sufficient condition for the existence of a spanning k-hypertree in connected hypergraphs is established. The algorithm for checking the existence of a spanning k-hypertree and its complexity analysis are also presented. The distance spectral radius of a hypergraph H, denoted as λDH, is defined as the largest eigenvalue of its distance matrix DH. A lower bound for λDH is established for a connected hypergraph H. Combined with typical distance spectral techniques and structural analysis of hypergraphs, this bound yields sufficient conditions for the existence of spanning k-hypertrees in terms of the distance spectral radius.

Date: 2026
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/jmath/2026/9961860.pdf (application/pdf)
http://downloads.hindawi.com/journals/jmath/2026/9961860.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jjmath:9961860

DOI: 10.1155/jom/9961860

Access Statistics for this article

More articles in Journal of Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().