CSpace
Counting acyclic hypergraphs
Wang, JF; Li, HZ
2001-02-01
Source PublicationSCIENCE IN CHINA SERIES A-MATHEMATICS PHYSICS ASTRONOMY
ISSN1006-9283
Volume44Issue:2Pages:220-224
AbstractAcyclic 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.
Keywordacyclic hypergraph enumeration of acyclic hypergraphs
Language英语
WOS Research AreaMathematics
WOS SubjectMathematics, Applied ; Mathematics
WOS IDWOS:000167195800009
PublisherSCIENCE PRESS
Citation statistics
Cited Times:2[WOS]   [WOS Record]     [Related Records in WOS]
Document Type期刊论文
Identifierhttp://ir.amss.ac.cn/handle/2S8OKBNM/16557
Collection中国科学院数学与系统科学研究院
AffiliationChinese Acad Sci, Acad Math & Syst Sci, Inst Appl Math, Beijing 100080, Peoples R China
Recommended Citation
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.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Wang, JF]'s Articles
[Li, HZ]'s Articles
Baidu academic
Similar articles in Baidu academic
[Wang, JF]'s Articles
[Li, HZ]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Wang, JF]'s Articles
[Li, HZ]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.