Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
