Tenacity and rupture degree of permutation graphs of complete bipartite graphs
From MaRDI portal
(Redirected from Publication:648422)
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)
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
Cited in
(8)- Link vulnerability in networks
- Node and link vulnerability in complete multipartite networks
- Extreme tenacity of graphs with given order and size
- On edge-rupture degree of graphs
- A note on the link residual closeness of graphs under join operation
- Computing tenacity, rupture degree and some other vulnerability parameters in polynomial time for classes of intersection graphs.
- Computational complexity of network vulnerability analysis
- scientific article; zbMATH DE number 6311155 (Why is no real title available?)
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)
