WSEAS Transactions on Mathematics
Print ISSN: 1109-2769, E-ISSN: 2224-2880
Volume 11, 2012
Computing Rupture Degrees of Some Graphs
Authors: , ,
Abstract: Computer or communication networks are so designed that they do not easily get disrupted under ex- ternal attack and, moreover, these are easily reconstructed when they do get disrupted. These desirable properties of networks can be measured by various parameters such as connectivity, toughness, tenacity and rupture degree. Among these parameters, rupture degree is comparatively better parameter to measure the vulnerability of net- works. In this paper, the authors give the exact values for the rupture degree of the Cartesian product of a path and a cycle. After that, we discuss the rupture degree of total graphs of paths and cycles. Finally, we study the values for rupture degree of powers of paths and cycles.