On the Decay Number of a Graph

作     者：LIDe-ming LI De-ming

作者机构：DepartmentofMathematicsCapitalNormalUniversityBeijing100037China 

出 版 物：《Chinese Quarterly Journal of Mathematics》 (数学季刊（英文版）)

年 卷 期：2005年第20卷第2期

页      面：121-127页

核心收录：

学科分类：07[理学] 070104[理学-应用数学] 0701[理学-数学] 

基　　金：Supported by the NSFC(10201022)Supported by the NSFCBJ(1012003) 

主　　题：decay number edge connectivity bound 

摘      要：The decay number of a connected graph is defined to be the minimum number of the components of the cotree of the graph. Upper bounds of the decay numbers of graphs are obtained according to their edge connectivities. All the bounds in this paper are ***, for each integer k between one and the upper bound, there are infinitely many graphs with the decay number k.