Tenacity and rupture degree of permutation graphs of complete bipartite graphs
zbMATH Open1233.05128MaRDI QIDQ648422FDOQ648422
Authors: Fengwei Li, Qingfang Ye, Xueliang 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
Recommendations
- scientific article; zbMATH DE number 21737
- Tenacity of total graphs
- Neighbor rupture degree of total graphs and their complements
- The rupture degree of some graphs
- scientific article; zbMATH DE number 1896992
- Extreme tenacity of graphs with given order and size
- scientific article; zbMATH DE number 6311155
- Computing the tenacity of some graphs
- Extremal graphs with given order and the rupture degree
- Rupture degree of graphs
Permutations, words, matrices (05A05) Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Applications of graph theory to circuits and networks (94C15) Network design and communication in computer systems (68M10)
Cited In (7)
- Node and link vulnerability in complete multipartite networks
- A Note on the Link Residual Closeness of Graphs Under Join Operation
- Extreme tenacity of graphs with given order and size
- Computational complexity of network vulnerability analysis
- Title not available (Why is that?)
- 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q648422)
