On the Decay Number of a Graph

• 作 者: LIDe-ming
• 机 构: DepartmentofMathematics
• 出 处: 数学季刊：英文版
• 发表日期: 2005年2期
• 关键词: 图论 边缘连通 衰退数 生成树 decay number edge connectivity bound
• 基金项目: Supported by the NSFC(10201022)Supported by the NSFCBJ(1012003)

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 tight