文献类型：期刊文献

英文题名：Computing rupture degrees of some graphs

作者：Li, Fengwei[1]; Ye, Qingfang[1]; Sheng, Baohuai[1]

机构：[1] Department of Mathematics, Shaoxing University, Shaoxing, Zhejiang 312000, China

年份：2012

卷号：11

期号：1

起止页码：23

外文期刊名：WSEAS Transactions on Mathematics

收录：EI(收录号：20121214879111)、Scopus(收录号：2-s2.0-84858399940)

语种：英文

外文关键词：Mathematical techniques

外文摘要：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.