| Article ID: | iaor1993663 |
| Country: | Netherlands |
| Volume: | 37/38 |
| Issue: | 1/5 |
| Start Page Number: | 13 |
| End Page Number: | 18 |
| Publication Date: | Jul 1991 |
| Journal: | Discrete Applied Mathematics |
| Authors: | Bagga K.S., Beineke L.W., Goddard W.D., Lipman M.J., Pippert R.E. |
| Keywords: | graphs |
A communication network can be considered to be highly vulnerable to disruption if the destruction of a few elements can result in no member’s being able to communicate with very many others. This idea suggests the concept of the integrity of a graph-the minimum sum of the orders of a set of vertices being removed and a largest remaining component. This survey includes results on the integrity of specific families of graphs and combinations of graphs, relationships with other parameters, bounds, computational complexity, and some variations on the concept.