Tenacity of a graph with maximum connectivity

DOI10.1016/j.dam.2010.11.008zbMath1210.05072OpenAlexW2033373392MaRDI QIDQ628322

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

zbMATH Keywords

maximum connectivitytenacity parameter

Mathematics Subject Classification ID

Connectivity (05C40)

Related Items (7)

On the first-order edge tenacity of a graph ⋮ A note on ``Tenacity of a graph with maximum connectivity ⋮ Unnamed Item ⋮ Neighbor Isolated Tenacity of Graphs ⋮ Computing the weighted neighbor isolated tenacity of interval graphs in polynomial time ⋮ Vulnerability of nearest neighbor graphs ⋮ A Comparison Between Edge Neighbor Rupture Degree and Edge Scattering Number in Graphs

Cites Work

• Some results related to the tenacity and existence of \(k\)-trees
• Tenacity of complete graph products and grids
• Edge‐tenacious networks
• On the edge-tenacity of the middle graph of a graph
• THE MAXIMUM CONNECTIVITY OF A GRAPH
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Tenacity of a graph with maximum connectivity