| k-树图的收缩边 |
| |
| 引用本文： | 黄乐贤,覃城阜.k-树图的收缩边[J].广西师院学报,2014(2):10-13,28. |
| |
| 作者姓名： | 黄乐贤 覃城阜 |
| |
| 作者单位： | 广西师范学院数学科学学院,广西南宁530023 |
| |
| 基金项目： | 广西自然科学基金（2012GXNSFBA053005） |
| |
| 摘 要： | Narayanaswamy ，Sadagopan和Sunil Chandran证明了k-树图G可收缩边数目的下界为V（G）＋ k -2，并指出这个界是紧的。该文给出了 k-树图G可收缩边数目更一般的下界，由该文的结果可以推出Narayanaswamy等人的结果，进一步证明了可收缩边数目恰好为V （G ）＋ k -2的图的特征。
|
| 关 键 词： | k-树 连通度 收缩边 |
The Contractible Edges of k-tree |
| |
| HUANG Le-xian,QIN Cheng-fu.The Contractible Edges of k-tree[J].Journal of Guangxi Teachers College(Natural Science Edition),2014(2):10-13,28. |
| |
| Authors: | HUANG Le-xian QIN Cheng-fu |
| |
| Institution: | (School of Mathematical Science, Guangxi Teachers Education University,Nanning 530023, China) |
| |
| Abstract: | Narayanaswamy ,Sadagopan and Sunil Chandran showed that the lower bound of the number of contractible edges of k-tree G is ｜V （G）｜ ＋ k -2 and this bound is tight .In this paper ,we provide a more general lower bound for the number of contractible edges of G and the result of Naray-anaswamy ,et al .is just a corollary of our result .We characterize the graph with exactly V （G） ＋ k-2 contractible edges . |
| |
| Keywords: | k-tree connectivity contractible edge |
| 本文献已被 维普 等数据库收录！ |
