•  
  •  
 

Abstract

We introduce a new measure of network reliability related to the order of the largest component. This new connectivity measure considers a network to be operational if there is a component or order at least some fixed proportion, r, of the original order. Thus, the network is in a failure state if all components are sufficiently small. In this paper, we consider the parameters with vertex deletions as well as edge deletions for particular graph classes. We also find the minimum values of the parameter for graphs with a fixed size and order. We end with a discussion and some conjectures for the maximum value of the parameter for graphs with a fixed size and order.

Creative Commons License

Creative Commons Attribution 4.0 International License
This work is licensed under a Creative Commons Attribution 4.0 International License.

Share

COinS
 
 

To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.