Residual Closeness of Wheels and Related Networks
Loading...
Files
Date
2011
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
World Scientific Publ Co Pte Ltd
Open Access Color
Green Open Access
No
OpenAIRE Downloads
OpenAIRE Views
Publicly Funded
No
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.
Description
Keywords
Graph vulnerability, connectivity, closeness, gear graph, friendship graph, Connectivity, Network design and communication in computer systems, graph vulnerability, Graph theory (including graph drawing) in computer science, connectivity, Graph vulnerability, gear graph, closeness, friendship graph
Fields of Science
0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences
Citation
WoS Q
Q4
Scopus Q
Q3

OpenCitations Citation Count
24
Source
Internatıonal Journal of Foundatıons of Computer Scıence
Volume
22
Issue
5
Start Page
1229
End Page
1240
PlumX Metrics
Citations
CrossRef : 6
Scopus : 36
Captures
Mendeley Readers : 9
Google Scholar™


