Arc fault tolerance of Cartesian product of regular digraphs on super-restricted arc-connectivity
From MaRDI portal
Publication:1630926
DOI10.7151/dmgt.2065zbMath1401.05258OpenAlexW2794715105MaRDI QIDQ1630926
Publication date: 5 December 2018
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.2065
fault toleranceCartesian productregular digraphrestricted arc-connectivitysuper-restricted arc-connectivity
Directed graphs (digraphs), tournaments (05C20) Reliability, testing and fault tolerance of networks and computer systems (68M15) Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Unnamed Item
- Unnamed Item
- Vulnerability of super edge-connected networks
- Edge fault tolerance of graphs with respect to super edge connectivity
- Double-super-connected digraphs
- Cyclic arc-connectivity in a Cartesian product digraph
- Super-connected and super-arc-connected Cartesian product of digraphs
- \(\lambda ^{\prime}\)-optimal digraphs
- The restricted arc connectivity of Cartesian product digraphs
- On computing a conditional edge-connectivity of a graph
- Connectivity of Cartesian product digraphs and fault-tolerant routings of generalized hypercubes
- Restricted arc-connectivity of digraphs
- Arc fault tolerance of cartesian product digraphs on hyper arc connectivity
- Bounds for the Super Extra Edge Connectivity of Graphs
- Reliability of interconnection networks modeled by Cartesian product digraphs
- Combinatorial optimization problems in the analysis and design of probabilistic networks
- On the super‐restricted arc‐connectivity of s ‐geodetic digraphs
This page was built for publication: Arc fault tolerance of Cartesian product of regular digraphs on super-restricted arc-connectivity
