Node and Link Vulnerability in Complete Multipartite Networks
Authors:
- 21 March 2023
- journal article
- research article
- Published by World Scientific Pub Co Pte Ltd in International Journal of Foundations of Computer Science
- Vol. 35 (04) , 375-385
Abstract
Networks are known to be prone to node or link failures. A central issue in the analysis of networks is the assessment of their stability and reliability. A central concept that is used to assess stability and robustness of the performance of a network under failures is that of vulnerability. Node and link residual closeness are novel sensitive graph based characteristics for network vulnerability analysis. Node and link residual closeness measure the vulnerability even when the removal of nodes or links does not disconnect the network. Node and link residual closeness are of great theoretical and practical significance to network design and optimization. In this paper, vulnerabilities of multipartite network type topologies to the failure of individual nodes and links are computed via node and link residual closeness which provides a much fuller characterization of the network. Then, how multipartite network type topologies perform when they suffer a node or a link failure is analyzed.Keywords
This publication has 22 references indexed in Scilit:
- Residual Closeness of Generalized Thorn GraphsFundamenta Informaticae, 2018
- Network robustness and residual closenessRAIRO - Operations Research, 2018
- Link Vulnerability in NetworksInternational Journal of Foundations of Computer Science, 2018
- Robustness of Regular CaterpillarsInternational Journal of Foundations of Computer Science, 2017
- Eigenvalues of complete multipartite graphsDiscrete Mathematics, 2012
- RESIDUAL CLOSENESS AND GENERALIZED CLOSENESSInternational Journal of Foundations of Computer Science, 2011
- RESIDUAL CLOSENESS OF WHEELS AND RELATED NETWORKSInternational Journal of Foundations of Computer Science, 2011
- Residual closeness in networksPhysica A: Statistical Mechanics and its Applications, 2006
- Rupture degree of graphsInternational Journal of Computer Mathematics, 2005
- Computing the Scattering Number of GraphsInternational Journal of Computer Mathematics, 2002