Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.14365/2124
Title: RESIDUAL CLOSENESS OF WHEELS AND RELATED NETWORKS
Authors: Aytac, Aysun
Odabas, Zeynep Nihan
Keywords: Graph vulnerability
connectivity
closeness
gear graph
friendship graph
Publisher: World Scientific Publ Co Pte Ltd
Abstract: The vulnerability of a network measures the resistance of the network to disruption of operation after the failure of certain stations or communication links. If we think of a graph as modeling a network, several vulnerability measures have been used to describe the stability of networks, including connectivity, toughness, scattering number, binding number and integrity. We consider a new characteristic, residual closeness which is more sensitive than the well-known vulnerability measures. Residual closeness measures the network resistance evaluating closeness after removal of vertices or links. In this paper, closeness, vertex residual closeness (VRC) and normalized vertex residual closeness (NVRC) of wheels and some related networks namely gear and friendship graph are calculated, and exact values are obtained.
URI: https://doi.org/10.1142/S0129054111008660
https://hdl.handle.net/20.500.14365/2124
ISSN: 0129-0541
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 
2124.pdf
  Restricted Access
183.32 kBAdobe PDFView/Open    Request a copy
Show full item record



CORE Recommender

SCOPUSTM   
Citations

31
checked on Nov 27, 2024

WEB OF SCIENCETM
Citations

32
checked on Nov 27, 2024

Page view(s)

76
checked on Nov 25, 2024

Download(s)

2
checked on Nov 25, 2024

Google ScholarTM

Check




Altmetric


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