The Menger number of the Cartesian product of graphs

DOI10.1016/j.aml.2010.11.026zbMath1213.05149OpenAlexW1984190495MaRDI QIDQ628251

Qiang Zhu, Jun-Ming Xu, Meijie Ma

Publication date: 10 March 2011

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aml.2010.11.026

zbMATH Keywords

pathCartesian productinterconnection networkMenger number

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph operations (line graphs, products, etc.) (05C76)

Related Items (2)

The Menger number of the strong product of graphs ⋮ Alliance free sets in Cartesian product graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Retracts of strong products of graphs
• Connectivity of Cartesian product graphs
• Bounded edge-connectivity and edge-persistence of Cartesian product of graphs
• Connectivity of Cartesian products of graphs
• On the \(\{k\}\)-domination number of Cartesian products of graphs
• Hamiltonicity and pancyclicity of Cartesian products of graphs
• Heuristics for finding a maximum number of disjoint bounded paths
• Synthesis of reliable networks - a survey
• Graphs as models of communication network vulnerability: Connectivity and persistence
• A counterexample to a conjecture on paths of bounded length
• The complexity of finding maximum disjoint paths with length constraints

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