2023/11/05 by Leyou Xu, Xu, Leyou, Chengli Li +3
Computer Science · Mathematics · #Advanced Graph Theory Research #FOS: Computer and information sciences #Graph theory and applications #Interconnection Networks and Systems #Social and Information Networks (cs.SI)
paper · pdf · doi:10.48550/arxiv.2311.02571
openalex publication_date 2023/11/05 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Link residual closeness is a newly proposed measure for network vulnerability. In this model, vertices are perfectly reliable and the links fail independently of each other. It measures the vulnerability even when the removal of links does not disconnect the graph. In this paper, we characterize those graphs that maximize the link residual closeness over the connected graphs with fixed order and one parameters such as connectivity, edge connectivity, bipartiteness, independence number, matching number, chromatic number, number of vertices and number of cut edges.