Computing the tenacity of some graphs
From MaRDI portal
Publication:5325549
zbMATH Open1213.05260MaRDI QIDQ5325549FDOQ5325549
Authors: Vecdi Aytac 
Publication date: 10 August 2009
Recommendations
Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Connectivity (05C40) Graph theory (05C99)
Cited In (20)
- On the first-order edge tenacity of a graph
- Title not available (Why is that?)
- Title not available (Why is that?)
- Extreme tenacity of graphs with given order and size
- 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
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
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)
