{"title":"给定分数匹配数的图的顶点和链路残差紧密性","authors":"Hui Dong","doi":"10.1142/s0129054123500193","DOIUrl":null,"url":null,"abstract":"Vertex and link residual closeness are two new measures of network vulnerability due to the failure of individual vertices and links, respectively. We identify those graphs with maximum vertex/link residual closeness over all [Formula: see text]-vertex connected graphs with fixed fractional matching number.","PeriodicalId":50323,"journal":{"name":"International Journal of Foundations of Computer Science","volume":null,"pages":null},"PeriodicalIF":0.6000,"publicationDate":"2023-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Vertex and Link Residual Closeness of Graphs of Given Fractional Matching Number\",\"authors\":\"Hui Dong\",\"doi\":\"10.1142/s0129054123500193\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Vertex and link residual closeness are two new measures of network vulnerability due to the failure of individual vertices and links, respectively. We identify those graphs with maximum vertex/link residual closeness over all [Formula: see text]-vertex connected graphs with fixed fractional matching number.\",\"PeriodicalId\":50323,\"journal\":{\"name\":\"International Journal of Foundations of Computer Science\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2023-09-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Foundations of Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1142/s0129054123500193\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Foundations of Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/s0129054123500193","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
Vertex and Link Residual Closeness of Graphs of Given Fractional Matching Number
Vertex and link residual closeness are two new measures of network vulnerability due to the failure of individual vertices and links, respectively. We identify those graphs with maximum vertex/link residual closeness over all [Formula: see text]-vertex connected graphs with fixed fractional matching number.
期刊介绍：
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
分享
求助内容：
应助结果提醒方式：
扫码关注我们
