Arc fault tolerance of cartesian product digraphs on hyper arc connectivity
From MaRDI portal
Publication:2931954
DOI10.1080/00207160.2014.883069zbMath1307.68058OpenAlexW1983017714MaRDI QIDQ2931954
Publication date: 28 November 2014
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2014.883069
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)
Related Items (1)
Cites Work
- 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
- The restricted arc connectivity of Cartesian product digraphs
- Connectivity of Cartesian product digraphs and fault-tolerant routings of generalized hypercubes
- Reliability of interconnection networks modeled by Cartesian product digraphs
- Combinatorial optimization problems in the analysis and design of probabilistic networks
This page was built for publication: Arc fault tolerance of cartesian product digraphs on hyper arc connectivity