关键词: 毁度, 单圈图, 递归算法

Abstract: The rupture degree of a noncomplete connected graph G is defined as r(G)=max{ω(G-X)-|X|-m(G-X):X?V(G),ω(G-X)>1},where ω(G-X) is the number of components of G-Xand[m(G-X) is the order of a largest component of G-X.As to the complete graph，its rupture degree is defined as n.An algorithm for computing the rupture degree of unicycle graphs is presented.

Key words: the rupture degree, unicycle graphs, recursive algorithm