Robustness of Regular Caterpillars
Articles > Article · 2017
Authors: Aysun AYTAÇ, Zeynep Nihan Odabas Berberler
International Journal of Foundations of Computer Science, Journal Indexed in SCI Expanded, International, WoS, 2017, vol 28, pp 835-841
DOI: 10.1142/s0129054117500277
Summary
Robustness of the network topology is a key aspect in the design of computer networks. Vertex residual closeness is a new graph-theoretic concept defined as a measure of network robustness. In this model, edges are perfectly reliable and the vertices fail independently of each other. In this paper, vertex residual closeness of paths and regular caterpillars are calculated by giving an insight of how to evaluate the vertex residual closeness of path-like graphs.