The scattering number of thorn graphs
Küçük Resim Yok
Tarih
2004
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Taylor & Francis Ltd
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
The scattering number of a non-complete connected graph G is defined by sc(G) = max{w(G-S) - \S\: S subset of V (G) and w(G-S) greater than or equal to 2} , where w(G-S) denotes the number of components of the graph G-S . If an interconnection network is modelled as a graph, then the scattering number shows not only the difficulty to break down the network but also the damage that has been caused. This article includes several results on the scattering number of thorn graphs as an interconnection network. In addition, the scattering numbers of graphs obtained via various operations are computed. These operations are union and product.
Açıklama
Anahtar Kelimeler
scattering number, stability
Kaynak
International Journal of Computer Mathematics
WoS Q Değeri
Q4
Scopus Q Değeri
Q2
Cilt
81
Sayı
3
