Link residual closeness of graphs with fixed parameters
Social and Information Networks
2023-11-07 v1
Abstract
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.
Keywords
Cite
@article{arxiv.2311.02571,
title = {Link residual closeness of graphs with fixed parameters},
author = {Leyou Xu and Chengli Li and Bo Zhou},
journal= {arXiv preprint arXiv:2311.02571},
year = {2023}
}
Comments
Completed June 2022