Super restricted edge connected Cartesian product graphs

DOI10.1016/j.ipl.2009.02.025zbMath1197.05082OpenAlexW2018475291MaRDI QIDQ989444

Juan Liu, Xing Chen, Ji Xiang Meng

Publication date: 20 August 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2009.02.025

zbMATH Keywords

combinatorial problemsCartesian productrestricted edge connectivity\(\lambda'\)-optimalrestricted edge cutsuper-\(\lambda'\)

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)

Related Items (3)

A new approach to finding the extra connectivity of graphs ⋮ On restricted edge-connectivity of lexicographic product graphs ⋮ Vulnerability of super edge-connected networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Connectivity of Cartesian product graphs
• Super-connected and super-arc-connected Cartesian product of digraphs
• On computing a conditional edge-connectivity of a graph
• Connectivity of Cartesian product digraphs and fault-tolerant routings of generalized hypercubes
• On connectivity of the cartesian product of two graphs
• Super restricted edge-connectivity of vertex-transitive graphs
• Super restricted edge connectivity of regular graphs
• Graphs with Given Group and Given Graph-Theoretical Properties
• On super edge-connectivity of Cartesian product graphs
• Sufficient conditions for graphs to be λ′‐optimal and super‐λ′
• On super connectivity of Cartesian product graphs
• Super edge- and point-connectivities of the Cartesian product of regular graphs

This page was built for publication: Super restricted edge connected Cartesian product graphs