Residual Closeness in Cycles and Related Networks

Odabas Z. N. , AYTAÇ A.

FUNDAMENTA INFORMATICAE, vol.124, no.3, pp.297-307, 2013 (Journal Indexed in SCI) identifier identifier

  • Publication Type: Article / Article
  • Volume: 124 Issue: 3
  • Publication Date: 2013
  • Doi Number: 10.3233/fi-2013-835
  • Page Numbers: pp.297-307


Networks are known to be prone to node or link failures. A central issue in the analysis of networks is the assessment of their stability and reliability. The main aim is to understand, predict, and possibly even control the behavior of a networked system under attacks or disfunctions of any type. A central concept that is used to assess stability and robustness of the performance of a network under failures is that of vulnerability. A network is usually represented by an undirected simple graph where vertices represent processors and edges represent links between processors. Different approaches to properly define a measure for graph vulnerability has been proposed so far. In this paper, we study the vulnerability of cycles and related graphs to the failure of individual vertices, using a measure called residual closeness which provides a more sensitive characterization of the graph than some other well-known vulnerability measures.