Tenacity of a graph with maximum connectivity
From MaRDI portal
Publication:628322
DOI10.1016/J.DAM.2010.11.008zbMATH Open1210.05072OpenAlexW2033373392MaRDI QIDQ628322FDOQ628322
Authors: Dara Moazzami 
Publication date: 10 March 2011
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2010.11.008
Recommendations
Cites Work
- Some results related to the tenacity and existence of \(k\)-trees
- Tenacity-maximum graphs
- Tenacity of complete graph products and grids
- On networks with maximum graphical structure and tenacity \(T\)
- Graph theory with applications
- Title not available (Why is that?)
- Tenacity and the maximum network
- On the edge-tenacity of graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Edge‐tenacious networks
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the edge-tenacity of the middle graph of a graph
- Title not available (Why is that?)
- Title not available (Why is that?)
- THE MAXIMUM CONNECTIVITY OF A GRAPH
Cited In (11)
- Title not available (Why is that?)
- On the first-order edge tenacity of a graph
- Title not available (Why is that?)
- Computing the weighted neighbor isolated tenacity of interval graphs in polynomial time
- Tenacity and the maximum network
- Neighbor Isolated Tenacity of Graphs
- The weak hyperedge tenacity of the hypercycles
- A note on ``Tenacity of a graph with maximum connectivity
- On networks with maximum graphical structure and tenacity \(T\)
- A Comparison Between Edge Neighbor Rupture Degree and Edge Scattering Number in Graphs
- Vulnerability of nearest neighbor graphs
This page was built for publication: Tenacity of a graph with maximum connectivity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q628322)
