The counting series for (k+1)-uniform linear acyclic hypergraphs
- ISSN号:0023-074X
- 期刊名称:《科学通报》
- 时间:0
- 分类:O157.5[理学—数学;理学—基础数学]
- 作者机构:[1]S China Normal Univ, Dept Math, Guangzhou 510631, Peoples R China, [2]Guangdong Polytech Normal Univ, Dept Comp Sci, Guangzhou 510633, Peoples R China
- 相关基金:This work was supported by the National Natural Science Foundation of China (Grant No. 19771040);and the Natural Science Foundation of Guangdong Province.
关键词:
HYPERGRAPH, LINEAR, HYPERGRAPH, HYPERTREE, BIPARTITE, tree, Polya’s, ENUMERATION, Theorem., hypergraph, linear hypergraph, hypertree, bipartite tree, Pólya’s Enumeration Theorem
中文摘要:
The explicit formula for (k+l)-uniform linear acyclic hypergraphs and the counting series for unlabeled (k +1)-uniform linear acyclic hypergraphs are obtained.
英文摘要:
The explicit formula for (k+1)-uniform linear acyclic hypergraphs and the counting series for unlabeled (k + 1)-uniform linear acyclic hypergraphs are obtained.