Computing the tenacity of some graphs
From MaRDI portal
Publication:5325549
Recommendations
Cited in
(20)- scientific article; zbMATH DE number 1877027 (Why is no real title available?)
- On the first-order edge tenacity of a graph
- Extreme tenacity of graphs with given order and size
- scientific article; zbMATH DE number 7404149 (Why is no real title available?)
- scientific article; zbMATH DE number 6264095 (Why is no real title available?)
- Computing the weighted neighbor isolated tenacity of interval graphs in polynomial time
- Neighbor Isolated Tenacity of Graphs
- Recognizing tenacious graphs is NP-hard.
- On the higher-order edge-tenacity of a graph
- Exponential independence number of some graphs
- The weak hyperedge tenacity of the hypercycles
- A note on ``Tenacity of a graph with maximum connectivity
- Tenacity-maximum graphs
- On networks with maximum graphical structure and tenacity \(T\)
- Tenacity of complete graph products and grids
- Tenacity of total graphs
- Tenacity and rupture degree of permutation graphs of complete bipartite graphs
- scientific article; zbMATH DE number 6770058 (Why is no real title available?)
- Computing tenacity, rupture degree and some other vulnerability parameters in polynomial time for classes of intersection graphs.
- Spectral bounds for the vulnerability parameters of graphs
This page was built for publication: Computing the tenacity of some graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5325549)
