Chinese Quarterly Journal of Mathematics ›› 2005, Vol. 20 ›› Issue (2): 121-127.

Previous Articles     Next Articles

On the Decay Number of a Graph

  

  1. Department of Mathematics, Capital Normal University, Beijing 100037, China 
  • Received:2003-07-08 Online:2005-06-30 Published:2024-01-18
  • About author:LI De-ming(1968-),male,native of Liaocheng,Shandong,an associate professor of Capital Normal University,Ph.D.,engages in graph theory.
  • Supported by:
    Supported by the NSFC(10201022) Supported by the NSFCBJ(1012003);

Abstract: 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.

Key words: decay number, edge connectivity, bound

CLC Number: