Vertex and Link Residual Closeness of Graphs of Given Fractional Matching Number
-
Published:2023-09-09
Issue:
Volume:
Page:1-15
-
ISSN:0129-0541
-
Container-title:International Journal of Foundations of Computer Science
-
language:en
-
Short-container-title:Int. J. Found. Comput. Sci.
Affiliation:
1. Anhui Technical College of Industry and Economy, Hefei 230051, P. R. China
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.
Funder
Project of Domestic Visiting Scholars for Young Backbone Teachers in Colleges and Universities of Anhui Province
Natural Science Research Project of Anhui Educational Committee
Publisher
World Scientific Pub Co Pte Ltd
Subject
Computer Science (miscellaneous)