Volume 34 • Number 3 • 2011   • Tenacity and Rupture Degree of Permutation Graphs of Complete Bipartite Graphs Fengwei Li, Qingfang Ye and Xueliang Li Abstract. Computer or communication networks are so designed that they do not easily get disrupted under external 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, tenacity and rupture degree are comparatively better parameters to measure the vulnerability of networks. In this paper, the authors give the exact values for the tenacity and rupture degree of permutation graphs of complete bipartite graphs. 2010 Mathematics Subject Classification: 05C40, 05C90, 68R10, 94C15. Full text: PDF