中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
Counting acyclic hypergraphs

文献类型:期刊论文

作者Wang, JF; Li, HZ
刊名SCIENCE IN CHINA SERIES A-MATHEMATICS PHYSICS ASTRONOMY
出版日期2001-02-01
卷号44期号:2页码:220-224
关键词acyclic hypergraph enumeration of acyclic hypergraphs
ISSN号1006-9283
英文摘要Acyclic hypergraphs are analogues of forests in graphs. They are very useful in the design of databases. The number of distinct acyclic uniform hypergraphs with n labeled vertices is studied. With the aid of the principle of inclusion-exclusion, two formulas are presented. One is the explicit formula for strict ( d)-connected acyclic hypergraphs, the other is the recurrence formula for linear acyclic hypergraphs.
WOS研究方向Mathematics
语种英语
WOS记录号WOS:000167195800009
出版者SCIENCE PRESS
源URL[http://ir.amss.ac.cn/handle/2S8OKBNM/16556]  
专题中国科学院数学与系统科学研究院
通讯作者Wang, JF
作者单位Chinese Acad Sci, Acad Math & Syst Sci, Inst Appl Math, Beijing 100080, Peoples R China
推荐引用方式
GB/T 7714
Wang, JF,Li, HZ. Counting acyclic hypergraphs[J]. SCIENCE IN CHINA SERIES A-MATHEMATICS PHYSICS ASTRONOMY,2001,44(2):220-224.
APA Wang, JF,&Li, HZ.(2001).Counting acyclic hypergraphs.SCIENCE IN CHINA SERIES A-MATHEMATICS PHYSICS ASTRONOMY,44(2),220-224.
MLA Wang, JF,et al."Counting acyclic hypergraphs".SCIENCE IN CHINA SERIES A-MATHEMATICS PHYSICS ASTRONOMY 44.2(2001):220-224.

入库方式: OAI收割

来源:数学与系统科学研究院

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。