给定分数匹配数的图的顶点和链路残差紧密性

IF 0.6 4区计算机科学 Q4 COMPUTER SCIENCE, THEORY & METHODS

International Journal of Foundations of Computer Science Pub Date : 2023-09-09 DOI:10.1142/s0129054123500193

Hui Dong

{"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}

引用次数: 1

摘要

顶点和链路残差接近度分别是衡量单个顶点和链路失效导致的网络脆弱性的两种新方法。我们在所有的[公式:见文本]-具有固定分数匹配数的顶点连通图上识别具有最大顶点/链路残差接近度的图。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

International Journal of Foundations of Computer Science 工程技术-计算机：理论方法

CiteScore

1.60

自引率

12.50%

发文量

审稿时长

3 months

期刊介绍： 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