Algorithm for computing rupture degree of unicycle graphs
Yinkui Li · Computer Engineering and Applications Journal · 2010
The rupture degree of a noncomplete connected graph G is defined as r(G)= max{ω(G-X)-|X|-m(G-X):XV(G),ω(G-X) 1},where ω(G-X) is the number of components of G-X and 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.