Tenacity of complete graph products and grids

DOI10.1002/(SICI)1097-0037(199910)34:3%3C192::AID-NET3%3E3.0.CO;2-RMaRDI QIDQ2766101zbMATH OpenOpenAlexFDO

Authors N. Priya, S. A. Choudum

Publication date 27 January 2002

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/(sici)1097-0037(199910)34:3%3C192::aid-net3%3E3.0.co;2-r

zbMATH Keywords

Cartesian products of graphscommunication networksconnectivityintegritytenacitytoughness

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 6264095
• scientific article; zbMATH DE number 861347
• Extreme tenacity of graphs with given order and size
• Computing the tenacity of some graphs
• Tenacity of total graphs

Cites work

• Edge‐tenacious networks
• Graph theory with applications
• scientific article; zbMATH DE number 861347 (Why is no real title available?)
• Tough graphs and Hamiltonian circuits.

Cited in

(10)

• Some results related to the tenacity and existence of \(k\)-trees
• Stability theorems for graph vulnerability parameters
• On the first-order edge tenacity of a graph
• Tenacity of total graphs
• Extreme tenacity of graphs with given order and size
• Weak-rupture degree of graphs
• scientific article; zbMATH DE number 6264095 (Why is no real title available?)
• Tenacity of a graph with maximum connectivity
• Vertex vulnerability in wrapped butterfly network
• Vertex vulnerability parameters of Kronecker products of complete graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2766101)