The restricted arc connectivity of Cartesian product digraphs

DOI10.1016/j.ipl.2009.08.005zbMath1197.05081OpenAlexW2076919914MaRDI QIDQ990960

Juan Liu, Xing Chen, Ji Xiang Meng

Publication date: 1 September 2010

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

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

zbMATH Keywords

fault tolerancestrongly connected\(\lambda ^{\prime}\)-connectedCartesian product digraphsrestricted arc-connected

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)

Related Items (14)

Arc fault tolerance of Cartesian product of regular digraphs on super-restricted arc-connectivity ⋮ A new approach to finding the extra connectivity of graphs ⋮ Arc fault tolerance of cartesian product digraphs on hyper arc connectivity ⋮ On the super‐restricted arc‐connectivity of s ‐geodetic digraphs ⋮ Restricted arc-connectivity of unidirectional star graphs ⋮ Restricted arc-connectivity of generalized \(p\)-cycles ⋮ Cartesian product digraphs with optimal restricted arc connectivity ⋮ \(\lambda^{\prime}\)-optimality of bipartite digraphs ⋮ Restricted arc-connectivity in tournaments ⋮ Restricted arc-connectivity of bipartite tournaments ⋮ 3-restricted arc connectivity of digraphs ⋮ Cyclic arc-connectivity in a Cartesian product digraph ⋮ A note on the restricted arc connectivity of oriented graphs of girth four ⋮ On the optimality of 3-restricted arc connectivity for digraphs and bipartite digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(\lambda ^{\prime}\)-optimal digraphs
• Sufficient conditions for \(\lambda ^{\prime}\)-optimality of graphs with small conditional diameter
• On computing a conditional edge-connectivity of a graph
• Sufficient conditions for \(\lambda'\)-optimality in graphs of diameter 2
• Restricted arc-connectivity of digraphs
• Sufficient conditions for graphs to be λ′‐optimal and super‐λ′
• Fault tolerance measures for m-ary n-dimensional hypercubes based on forbidden faulty sets
• Sufficient conditions for λ′‐optimality in graphs with girth g
• On restricted edge-connectivity of graphs.

This page was built for publication: The restricted arc connectivity of Cartesian product digraphs