The Menger number of the Cartesian product of graphs
From MaRDI portal
Publication:628251
DOI10.1016/J.AML.2010.11.026zbMATH Open1213.05149OpenAlexW1984190495MaRDI QIDQ628251FDOQ628251
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
Recommendations
Cites Work
- Synthesis of reliable networks - a survey
- Title not available (Why is that?)
- Heuristics for finding a maximum number of disjoint bounded paths
- The complexity of finding maximum disjoint paths with length constraints
- Retracts of strong products of graphs
- Connectivity of Cartesian product graphs
- Connectivity of Cartesian products of graphs
- On the \(\{k\}\)-domination number of Cartesian products of graphs
- Graphs as models of communication network vulnerability: Connectivity and persistence
- Hamiltonicity and pancyclicity of Cartesian products of graphs
- A counterexample to a conjecture on paths of bounded length
- Title not available (Why is that?)
- Bounded edge-connectivity and edge-persistence of Cartesian product of graphs
Cited In (8)
- The Menger number of the strong product of graphs
- Title not available (Why is that?)
- Alliance free sets in Cartesian product graphs
- The Cartesian product of hypergraphs
- Title not available (Why is that?)
- Hadwiger number and the Cartesian product of graphs
- Zombie number of the Cartesian product of graphs
- Title not available (Why is that?)
This page was built for publication: The Menger number of the Cartesian product of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q628251)
