The following pages link to The rupture degree of trees (Q3543511):
Displaying 5 items.
- A polynomial algorithm for computing the weak rupture degree of trees (Q2279643) (← links)
- The condition of rupture degree for a graph having \(k\)-tree (Q2825135) (← links)
- (Q4980364) (← links)
- (Q5749304) (← links)
- On agglomeration-based rupture degree in networks and a heuristic algorithm (Q6050471) (← links)