## 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 language | English (US) |
---|---|

Pages | 4. 24-4. 28 |

State | Published - 1975 |

Externally published | Yes |

Event | Data Commun Symp, 4th, Proc, Network Struct in an Evol Oper Environ - Quebec City, Que, USA Duration: Oct 7 1975 → Oct 9 1975 |

### Other

Other | Data Commun Symp, 4th, Proc, Network Struct in an Evol Oper Environ |
---|---|

City | Quebec City, Que, USA |

Period | 10/7/75 → 10/9/75 |

## All Science Journal Classification (ASJC) codes

- Engineering(all)