SOME RESULTS FOR THE RUPTURE DEGREE
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
The rupture degree of an incomplete connected graph G is defined by r(G) = max{w(G - S) - vertical bar S vertical bar - m(G - S) : S CV(G), w(G - S) >= 2}, where w(G - 5) denotes the number of components in the graph G - S and m(G - 5) is the order of the largest component of G - S. This parameter can be used to measure the vulnerability of a graph. In this paper, some bounds consisted of the relationships between the rupture degree and some vulnerability parameters on the rupture degree of a graph are given.
Açıklama
Anahtar Kelimeler
Networks, vulnerability, connectivity, rupture degree
Kaynak
International Journal of Foundations of Computer Science
WoS Q Değeri
Q4
Scopus Q Değeri
Q3
Cilt
24
Sayı
8
