| 图的分散数 |
| |
| 引用本文： | LI De-ming (Department of Mathematics,Capital Normal University,Beijing 100037,China ). 图的分散数[J]. 数学季刊, 2005, 20(2): 121-127 |
| |
| 作者姓名： | LI De-ming (Department of Mathematics Capital Normal University Beijing 100037 China ) |
| |
| 作者单位： | Department of Mathematics，Capital Normal University，Beijing 100037，China |
| |
| 基金项目： | 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. Moreover, for each integer k between one and the upper bound, there are infinitely many graphs with the decay number k.
|
| 关 键 词： | 图论 边缘连通 衰退数 生成树 |
On the Decay Number of a Graph |
| |
| LIDe-ming. On the Decay Number of a Graph[J]. Chinese Quarterly Journal of Mathematics, 2005, 20(2): 121-127 |
| |
| Authors: | LIDe-ming |
| |
| Affiliation: | DepartmentofMathematics,CapitalNormalUniversity,Beijing100037,China |
| |
| 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. |
| |
| Keywords: | decay number edge connectivity bound |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
