期刊文献+

The counting series for (k+1)-uniform linear acyclic hypergraphs

The counting series for (k+1)-uniform linear acyclic hypergraphs
原文传递
导出
摘要 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.
出处 《Chinese Science Bulletin》 SCIE EI CAS 2001年第3期197-200,共4页
基金 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
  • 相关文献

参考文献3

  • 1Bolian Liu.Enumeration of hypertrees[].A J of Chinese Universities.1988
  • 2Wang Jianfang,Li Dong.The paths and circles of the hypergraphs, Science in China, Ser[].A.1998
  • 3F. Harary,E. M. Palmer.Graphic Enumeration[]..1973

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部