NEIGHBOR INTEGRITY OF TRANSFORMATION GRAPHS
Küçük Resim Yok
Tarih
2013
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
World Scientific Publ Co Pte Ltd
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
In a communication network, the vulnerability measures are essential to guide the designer in choosing an appropriate topology. They measure the stability of the network to disruption of operation after the failure of certain stations or communication links. If a station or operative is captured in a spy network, then the adjacent stations will be betrayed and are therefore useless in the whole network. In this sense, Margaret B. Cozzens and Shu-Shih Y. Wu modeled a spy network as a graph and then defined the neighbor integrity of a graph to obtain the vulnerability of a spy network [10]. The neighbor integrity of a graph G, is defined to be NI(G) = min(S subset of V(G)) {vertical bar S vertical bar + c(G/S)}, where S is any vertex subversion strategy of G and c(G/S) is the maximum order of the components of G/S. In this paper, we investigate the transformation graphs G(-+-), G(+--), G(++-), G(---), G(+-+), G(-++), G(--+) and G(+++) of a graph G, and determine their neighbor integrity.
Açıklama
Anahtar Kelimeler
Vulnerability, integrity, neighbor integrity, transformation graphs
Kaynak
International Journal of Foundations of Computer Science
WoS Q Değeri
Q4
Scopus Q Değeri
Cilt
24
Sayı
3
