Bounded edge-connectivity and edge-persistence of Cartesian product of graphs
From MaRDI portal
Publication:967381
DOI10.1016/j.dam.2009.07.003zbMath1213.05225OpenAlexW2087168989MaRDI QIDQ967381
Jun-Ming Xu, You Lu, Xin Min Hou
Publication date: 28 April 2010
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2009.07.003
Paths and cycles (05C38) Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Retracts of strong products of graphs
- Menger-type theorems with restrictions on path lengths
- Diameter vulnerability of graphs
- Diameter vulnerability of graphs by edge deletion
- Changing and unchanging the diameter of a hypercube
- Mengerian theorems for paths of bounded length
- How to decrease the diameter of triangle-free graphs
- Vulnerability of communication networks
- Diameter increase caused by edge deletion
- Fault Diagnosis in a Boolean n Cube Array of Microprocessors
- Graphs as models of communication network vulnerability: Connectivity and persistence
- On a measure of communication network vulnerability
- Theory and Application of Graphs
- Decreasing the diameter of bounded degree graphs
- Diameter bounds for altered graphs
This page was built for publication: Bounded edge-connectivity and edge-persistence of Cartesian product of graphs
