Tenacity and rupture degree of permutation graphs of complete bipartite graphs

zbMath1233.05128MaRDI QIDQ648422

Fengwei Li, Qingfang Ye, Xue Liang Li

Publication date: 22 November 2011

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: http://math.usm.my/bulletin/html/vol34_3_1.html

zbMATH Keywords

tenacitypermutation graphrupture degree

Mathematics Subject Classification ID

Applications of graph theory (05C90) Network design and communication in computer systems (68M10) Permutations, words, matrices (05A05) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Applications of graph theory to circuits and networks (94C15) Connectivity (05C40)

Related Items (4)

Computational complexity of network vulnerability analysis ⋮ A Note on the Link Residual Closeness of Graphs Under Join Operation ⋮ On edge-rupture degree of graphs ⋮ Link Vulnerability in Networks

This page was built for publication: Tenacity and rupture degree of permutation graphs of complete bipartite graphs