The Menger number of the strong product of graphs

DOI10.1016/j.disc.2013.03.002zbMath1279.05060OpenAlexW2090385244MaRDI QIDQ392649

A. Diánez, E. Abajo, Rocio M. Casablanca, Pedro García-Vázquez

Publication date: 15 January 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2013.03.002

zbMATH Keywords

bounded edge-connectivityedge-deletion problemedge-fault-tolerant diameterMenger number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12) Graph operations (line graphs, products, etc.) (05C76)

Related Items (1)

Gromov hyperbolicity in strong product graphs

Cites Work

• Unnamed Item
• On optimizing edge connectivity of product graphs
• The Menger number of the Cartesian product of graphs
• On the geodetic and the hull numbers in strong product graphs
• Maximally edge-connected and vertex-connected graphs and digraphs: A survey
• Mengerian theorems for paths of bounded length
• Connectivity of strong products of graphs
• The generalized 3-connectivity of Cartesian product graphs

This page was built for publication: The Menger number of the strong product of graphs