Chinese Quarterly Journal of Mathematics ›› 2005, Vol. 20 ›› Issue (2): 121-127.
Previous Articles Next Articles
Received:
Online:
Published:
About author:
Supported by:
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:
 
O157.5
LI De-ming . On the Decay Number of a Graph[J]. Chinese Quarterly Journal of Mathematics, 2005, 20(2): 121-127.
/ Recommend
Add to citation manager EndNote|Ris|BibTeX
URL: https://sxjk.magtechjournal.com/EN/
https://sxjk.magtechjournal.com/EN/Y2005/V20/I2/121