Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.14365/2484
Title: Residual Closeness in Cycles and Related Networks
Authors: Berberler, Zeynep Nihan
Aytac, Aysun
Keywords: Graph vulnerability
Closeness
Network design and communication
Stability
Communication network
Cycles
Graphs
Polynomials
Diameter
Publisher: Ios Press
Abstract: 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.
URI: https://doi.org/10.3233/FI-2013-835
https://hdl.handle.net/20.500.14365/2484
ISSN: 0169-2968
Appears in Collections:Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection
WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection

Files in This Item:
File SizeFormat 
2484.pdf
  Until 2030-01-01
96.39 kBAdobe PDFView/Open
Show full item record



CORE Recommender

WEB OF SCIENCETM
Citations

36
checked on Jul 2, 2025

Page view(s)

86
checked on Jun 30, 2025

Download(s)

4
checked on Jun 30, 2025

Google ScholarTM

Check




Altmetric


Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.