Vulnerability of Mycielski graphs via residual closeness

Küçük Resim Yok

Tarih

2015

Dergi Başlığı

Dergi ISSN

Cilt Başlığı

Yayıncı

Charles Babbage Research Centre

Erişim Hakkı

info:eu-repo/semantics/closedAccess

Özet

The vulnerability value of a communication network is the resistance of this communication network until some certain stations or communication links between these stations are disrupted and, thus communication interrupts. A communication network is modeled by a graph to measure the vulnerability as stations corresponding to the vertices and communication links corresponding to the edges. There are several types of vulnerability parameters depending upon the distance for each pair of two vertices. In this paper, closeness, vertex residual closeness (VRC) and normalized vertex residual closeness (NVRC) of some Mycielski graphs are calculated, furthermore upper and lower bounds are obtained.

Açıklama

Anahtar Kelimeler

Closeness, Connectivity, Graph vulnerability, Mycielski graphs, Network design and communication: Residual closeness

Kaynak

Ars Combinatoria

WoS Q Değeri

Scopus Q Değeri

Q4

Cilt

118

Sayı

Künye