On the Decay Number of a Graph

被引：0
作者：
LI De-ming (Department of Mathematics
机构：
来源：
数学季刊 | 2005年 / 02期
关键词：
decay number; edge connectivity; bound;
D O I：
暂无
中图分类号：
O157.5 [图论];
学科分类号：
070104 ;
摘要：
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. Moreover, for each integer k between one and the upper bound, there are infinitely many graphs with the decay number k.
引用
收藏
页码：121 / 127
页数：7
相关论文
共 9 条
  • [1] SIRAN J,SKOVIERA M.Characterization of the maximum genus of a signed graph. Journal of Combinatorial Theory . 1991
  • [2] SKOVIERA M.On the minimum number of components in a cotree of a graph. Mathematica Slovaca . 1999
  • [3] LI D,HAO R.Finding a smooth frame decomposition of a graph. Chin Quartly J of Mathematics . 2001
  • [4] SKOVIERA M.The decay number and the maximum genus of a graph. Mathematica Slovaca . 1992
  • [5] NEBESKY L.Characterizing the maximum genus of a connected graph. Czechoslovak Mathematical Journal . 1993
  • [6] FU H,TSAI M,XUONG N.The decay number and the maximum genus of diameter two graphs. Discrete Mathematics . 2001
  • [7] TUTTE W T.On the problem of decomposing a graph into n connected factors. Journal of the London Mathematical Society . 1961
  • [8] NEBESKY L.Characterization of the decay number of a connected graph. Mathematica Slovaca . 1995
  • [9] ST C J A,Nash-Williams.Edge disjoint spanning trees of finite graphs. Journal of the London Mathematical Society . 1961
1