The upper bound of essential cyclomatic numbers of hypergraphs

CSpace

	The upper bound of essential cyclomatic numbers of hypergraphs
	Wang, JF; Li, HZ
	2002-06-10
发表期刊	DISCRETE MATHEMATICS
ISSN	0012-365X
卷号	254 期号:1-3 页码:555-564
摘要	The 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.
关键词	hypergraph cyclomatic number
语种	英语
WOS研究方向	Mathematics
WOS类目	Mathematics
WOS记录号	WOS:000176452200036
出版者	ELSEVIER SCIENCE BV
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/17748
专题	中国科学院数学与系统科学研究院
通讯作者	Wang, JF
作者单位	Chinese Acad Sci, Inst Appl Math, Beijing 100080, Peoples R China
推荐引用方式 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.