The scattering number of thorn graphs
Makaleler > Tam Makale · 2004
Yazarlar: Alpay KIRLANGIÇ, Aysun AYTAÇ
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, SCI Expanded İndekslerine Giren Dergi, Uluslararası, 2004, cilt 81, ss 299-311
DOI: 10.1080/00207160410001661681
Ö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.