Tenacity of complete graph products and grids

DOI<192::AID-NET3>3.0.CO;2-R 10.1002/(SICI)1097-0037(199910)34:3<192::AID-NET3>3.0.CO;2-RzbMath0984.05053OpenAlexW2087203273MaRDI QIDQ2766101

N. Priya, Sheshayya A. Choudum

Publication date: 27 January 2002

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199910)34:3<192::aid-net3>3.0.co;2-r

zbMATH Keywords

communication networksconnectivitytenacitytoughnessintegrityCartesian products of graphs

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Connectivity (05C40)

Related Items (8)

On the first-order edge tenacity of a graph ⋮ Weak-Rupture Degree of Graphs ⋮ TENACITY OF TOTAL GRAPHS ⋮ Stability theorems for graph vulnerability parameters ⋮ Tenacity of a graph with maximum connectivity ⋮ Extreme tenacity of graphs with given order and size ⋮ Vertex vulnerability parameters of Kronecker products of complete graphs ⋮ Some results related to the tenacity and existence of \(k\)-trees

Cites Work

• Unnamed Item
• Unnamed Item
• Tough graphs and Hamiltonian circuits.
• Edge‐tenacious networks

This page was built for publication: Tenacity of complete graph products and grids