CSpace
The upper bound of essential cyclomatic numbers of hypergraphs
Wang, JF; Li, HZ
2002-06-10
Source PublicationDISCRETE MATHEMATICS
ISSN0012-365X
Volume254Issue:1-3Pages:555-564
AbstractThe essential cyclomatic number of a hypergraph is the maximum number of independent essential cycles of the hypergraph. In this paper, we first prove a general upper bound for the cyclomatic number in terms of the size, order and edge-size of a hypergraph. Then we give a sharp upper bound for (n - 2)-uniform hypergraphs of order n by solving an extremal problem of graphs. It is remarkable that this sharp upper bound is not generally achieved by the complete (n - 2)-uniform hypergraphs. (C) 2002 Elsevier Science B.V. All rights reserved.
Keywordhypergraph cyclomatic number
Language英语
WOS Research AreaMathematics
WOS SubjectMathematics
WOS IDWOS:000176452200036
PublisherELSEVIER SCIENCE BV
Citation statistics
Document Type期刊论文
Identifierhttp://ir.amss.ac.cn/handle/2S8OKBNM/17748
Collection中国科学院数学与系统科学研究院
AffiliationChinese Acad Sci, Inst Appl Math, Beijing 100080, Peoples R China
Recommended Citation
GB/T 7714
Wang, JF,Li, HZ. The upper bound of essential cyclomatic numbers of hypergraphs[J]. DISCRETE MATHEMATICS,2002,254(1-3):555-564.
APA Wang, JF,&Li, HZ.(2002).The upper bound of essential cyclomatic numbers of hypergraphs.DISCRETE MATHEMATICS,254(1-3),555-564.
MLA Wang, JF,et al."The upper bound of essential cyclomatic numbers of hypergraphs".DISCRETE MATHEMATICS 254.1-3(2002):555-564.
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.