The Rupture Degree of Graphs with k-Tree  

作　　者：Yinkui Li Qingning Wang Xiaoling Wang Yinkui Li;Qingning Wang;Xiaoling Wang(College of Mathematics and Statistics, Qinghai Nationalities University, Xining, China)

机构地区：[1]College of Mathematics and Statistics, Qinghai Nationalities University, Xining, China

出　　处：《Open Journal of Discrete Mathematics》2016年第2期105-107,共3页离散数学期刊（英文）

摘　　要：A k-tree of a connected graph G is a spanning tree with maximum degree at most k. The rupture degree for a connected graph G is defined by , where and , respectively, denote the order of the largest component and number of components in . In this paper, we show that for a connected graph G, if  for any cut-set , then G has a k-tree.A k-tree of a connected graph G is a spanning tree with maximum degree at most k. The rupture degree for a connected graph G is defined by , where and , respectively, denote the order of the largest component and number of components in . In this paper, we show that for a connected graph G, if  for any cut-set , then G has a k-tree.

关 键 词：The Rupture Degree K-TREE Induced Graph 

分 类 号：O15[理学—数学]