SOME RESULTS FOR THE RUPTURE DEGREE
Articles > Article · 2013
Authors: Aysun AYTAÇ, Hanife AKSU
International Journal of Foundations of Computer Science, Journal Indexed in SCI Expanded, International, WoS, 2013, vol 24, pp 1329-1338
DOI: 10.1142/s0129054113500366
Summary
The rupture degree of an incomplete connected graph G is defined by[Formula: see text] where w(G − S) denotes the number of components in the graph G − S and m(G − S) 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.