Counting spanning hypertrees in non-uniform hypergraphs based on sum operation

被引：0

作者：

Zhang, Ke ^{[1
]}

Guo, Jiachun ^{[2
]}

Dong, Lixin ^{[3
]}

Yin, Hongwei ^{[1
]}

机构：

[1] Huzhou Univ, Sch Informat Engn, Huzhou 313000, Zhejiang, Peoples R China

[2] Huzhou Coll, Sch Humanities, Huzhou 313000, Zhejiang, Peoples R China

[3] Qinghai Normal Univ, Sch Comp, Xining 810800, Peoples R China

来源：

INTERNATIONAL JOURNAL OF MODERN PHYSICS C | 2024年 / 35卷 / 04期

基金：

中国国家自然科学基金;

关键词：

Non-uniform hypergraph; the number of spanning hypertrees; the entropy of spanning hypertree; TREES;

D O I：

10.1142/S0129183124500426

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

The theoretical and applied research on hypergraph or hypernetwork is one of the hot topics of system science. Spanning hypertree extended from spanning tree is an interesting problem about this topic, but determining the number of spanning hypertrees in general hypergraphs is not suitable for generalizing from graph and more intractable. In this paper, we propose a definition of spanning hypertree which has less constraints than the traditional definition of spanning hypertree, and then find exact analytical expressions for the number of spanning hypertrees in several kinds of non-uniform hypergraphs based on sum operation. In addition, we define the entropy of spanning hypertree and conduct data experiments on the entropies of spanning hypertrees in four special classes of non-uniform hypergraphs.

引用

页数：15