{"title":"Node and Link Vulnerability in Complete Multipartite Networks","authors":"Zeynep Nihan Berberler, A. Aytaç","doi":"10.1142/s0129054123500077","DOIUrl":null,"url":null,"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.","PeriodicalId":50323,"journal":{"name":"International Journal of Foundations of Computer Science","volume":null,"pages":null},"PeriodicalIF":0.6000,"publicationDate":"2023-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Foundations of Computer Science","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1142/s0129054123500077","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 2
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.
期刊介绍：
The International Journal of Foundations of Computer Science is a bimonthly journal that publishes articles which contribute new theoretical results in all areas of the foundations of computer science. The theoretical and mathematical aspects covered include:
- Algebraic theory of computing and formal systems
- Algorithm and system implementation issues
- Approximation, probabilistic, and randomized algorithms
- Automata and formal languages
- Automated deduction
- Combinatorics and graph theory
- Complexity theory
- Computational biology and bioinformatics
- Cryptography
- Database theory
- Data structures
- Design and analysis of algorithms
- DNA computing
- Foundations of computer security
- Foundations of high-performance computing
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
