Residual Closeness, Matching Number and Chromatic Number

Authors:

Abstract
Residual closeness is a novel graph-based network vulnerability parameter. In this model, links are perfectly reliable and the nodes fail independently of each other. We characterize those graphs with maximum residual closeness and those connected graphs with minimum residual closeness when matching number (chromatic number, respectively) is fixed.

This publication has 18 references indexed in Scilit: