Restricted arc-connectivity of digraphs
From MaRDI portal
Publication:2379978
DOI10.1016/J.IPL.2007.04.004zbMATH Open1183.05046OpenAlexW2076958772MaRDI QIDQ2379978FDOQ2379978
Authors: Lutz Volkmann 
Publication date: 24 March 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2007.04.004
Recommendations
complexityfault toleranceedge-connectivityarc-connectivityrestricted edge-connectivityrestricted arc-connectivity
Cites Work
- Conditional connectivity
- Fault tolerance measures for m-ary n-dimensional hypercubes based on forbidden faulty sets
- On computing a conditional edge-connectivity of a graph
- Sufficient conditions for \(\lambda'\)-optimality in graphs of diameter 2
- A sufficient condition for the equality between the restricted edge-connectivity and the minimum edge-degree of graphs
- Sufficient conditions for λ′‐optimality in graphs with girth g
- Title not available (Why is that?)
- Sufficient conditions for graphs to be ??-optimal, super-edge-connected, and maximally edge-connected
- On restricted edge-connectivity of graphs.
- Title not available (Why is that?)
Cited In (31)
- Restricted arc-connectivity of Harary digraphs
- Finding strong bridges and strong articulation points in linear time
- Restricted arc-connectivity of unidirectional star graphs
- Strong articulation points and strong bridges in large scale graphs
- On the optimality of 3-restricted arc connectivity for digraphs and bipartite digraphs
- Cyclic arc-connectivity in a Cartesian product digraph
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- \(\{2,3\}\)-extraconnectivities of hypercube-like networks
- 3-restricted arc connectivity of digraphs
- Restricted arc-connectivity of generalized \(p\)-cycles
- Arc fault tolerance of Cartesian product of regular digraphs on super-restricted arc-connectivity
- On arc connectivity of direct-product digraphs
- Restricted arc-connectivity in tournaments
- Restricted arc-connectivity of bipartite tournaments
- \(\lambda ^{\prime}\)-optimal digraphs
- The restricted arc connectivity of Cartesian product digraphs
- Arc fault tolerance of Kautz digraphs
- Bounds on the \(k\)-restricted arc connectivity of some bipartite tournaments
- Restricted connectivity of total digraph
- \(\lambda^{\prime}\)-optimality of bipartite digraphs
- On the restricted arc-connectivity of \(s\)-geodetic digraphs
- On the super-restricted arc-connectivity of \(s\)-geodetic digraphs
- Restricted arc-connectivity of generalized de Bruijn digraphs and Kautz digraphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Restricted domination in arc-colored digraphs
- A new approach to finding the extra connectivity of graphs
- A note on the restricted arc connectivity of oriented graphs of girth four
- Restricted arc connectivity of unidirectional hypercubes and unidirectional folded hypercubes
- Cartesian product digraphs with optimal restricted arc connectivity
- A sufficient condition for equality of arc-connectivity and minimum degree of a digraph
This page was built for publication: Restricted arc-connectivity of digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2379978)
