Search
Close this search box.

Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

Vulnerability In Graphs-\(A\) Comparative Survey

C. A. Barefoot1, Roger Entringer2, Henda Swart3
1University of Colorado at Denver, Denver, CO 80202
2University of New Mexico, Albuquerque, NM 87131
3University of Natal, Durban 4001, Republic of South Africa
  • Published: 30/04/1987

Abstract

In assessing the “vulnerability” of a graph one determines the extent to which the graph retains certain properties after the removal of a number of vertices and/or edges. Four measures of vulnerability to vertex removal are compared for classes of graphs with edge densities ranging from that of trees to that of the complete graph.

Information
Guidelines
CP Initiatives
Follow CP
Facebook Twitter Linkedin
1970-2024 CP (Manitoba, Canada) unless otherwise stated.
Citation
C. A. Barefoot, Roger Entringer, Henda Swart. Vulnerability In Graphs-\(A\) Comparative Survey[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 001. 13-22. DOI: .