k-树图的收缩边
Journal of Guangxi Teachers Education University (Natural Science Edition)(2014)
Abstract
Narayanaswamy ,Sadagopan和Sunil Chandran证明了k-树图G可收缩边数目的下界为V(G)+ k -2,并指出这个界是紧的。该文给出了 k-树图G可收缩边数目更一般的下界,由该文的结果可以推出Narayanaswamy等人的结果,进一步证明了可收缩边数目恰好为V (G )+ k -2的图的特征。
MoreTranslated text
Key words
k-tree,connectivity,contractible edge
AI Read Science
Must-Reading Tree
Example
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined