CHARACTERIZING NETWORK VULNERABILITY BY k COMPONENT CUTS.

F. T. Boesch, S. Chen, J. A.M. McHugh

Research output: Contribution to conferencePaperpeer-review

Abstract

The idea of using graph theoretic invariants to study vulnerability of networks is well documented. The early work in this area dealt with the line connectivity lambda and point connectivity kappa of a graph. A variety of other measures have also been discussed in the literature, e. g. , the point independence number beta //o, the diameter d, and the minimum m-point degree delta //m. This work explores the properties of a simple generalization of lambda . This parameter designated by lambda //i is defined as the minimum number of lines which must be removed from a graph in order that the number of resulting components is greater than i. Several properties of lambda //i as a vulnerability measure are derived.

Original languageEnglish (US)
Pages4. 24-4. 28
StatePublished - 1975
Externally publishedYes
EventData Commun Symp, 4th, Proc, Network Struct in an Evol Oper Environ - Quebec City, Que, USA
Duration: Oct 7 1975Oct 9 1975

Other

OtherData Commun Symp, 4th, Proc, Network Struct in an Evol Oper Environ
CityQuebec City, Que, USA
Period10/7/7510/9/75

All Science Journal Classification (ASJC) codes

  • General Engineering

Cite this