Edge-integrity: a survey
โ
K.S. Bagga; L.W. Beineke; M.J. Lipman; R.E. Pippert
๐
Article
๐
1994
๐
Elsevier Science
๐
English
โ 584 KB
We consider the problem ofefficiently breaking a graph into small components through the removal of edges. One measure of how easily this can be done is the edge-integrity, defined to be the minimum sum of the number of edges removed and the order of a largest remaining component, taken over all set