Residual Closeness of Graphs with Given Parameters  

作　　者：Mei-Qun Cheng Bo Zhou 

机构地区：[1]School of Mathematical Sciences,South China Normal University,Guangzhou,510631,Guangdong,China

出　　处：《Journal of the Operations Research Society of China》2023年第4期839-856,共18页中国运筹学会会刊（英文）

基　　金：supported by the National Natural Science Foundation of China(No.12071158).

摘　　要：Robustness of the network topology is a key aspect in the design of computer networks. Residual closeness is a new graph-theoretic concept defined as a measure of network robustness due to the failure of individual vertices. We identify those graphs with maximum residual closeness among connected graphs with fixed connectivity, edge connectivity and bipartiteness, respectively.

关 键 词：Residual closeness CONNECTIVITY Edge connectivity Bipartiteness 

分 类 号：O15[理学—数学]