An Algorithm for Computing the Rupture Degree of Tree
Yinkui Li · Computer Engineering and Applications Journal · 2006
The rupture degree of a noncomplete connected graph G is defined by Y.Li et al 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-X and m(G-X) is the order of a largest component of G-X.In this paper,An algorithm for computing the rupture degree of tree is presented.