固定参数下图的链路剩余接近度
Link residual closeness of graphs with fixed parameters
AI总结：
本研究针对网络脆弱性度量问题，刻画了阶数及单个图参数固定的连通图中使链路剩余接近度最大化的图的特征，完善了链路剩余接近度的理论分析。
摘要：
链路剩余接近度是一种新提出的网络脆弱性度量指标。在该模型中，顶点完全可靠，链路故障相互独立。即使链路移除不会使图断开连接，它也能度量脆弱性。本文刻画了在阶数固定且连通性、边连通度、二部性、独立数、匹配数、色数、顶点数和割边数等某一参数固定的连通图中，使链路剩余接近度最大化的图的特征。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
