Restricted arc-connectivity of digraphs
From MaRDI portal
Publication:2379978
DOI10.1016/j.ipl.2007.04.004zbMath1183.05046MaRDI QIDQ2379978
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
complexity; fault tolerance; edge-connectivity; arc-connectivity; restricted edge-connectivity; restricted arc-connectivity
Related Items
On the super‐restricted arc‐connectivity of s ‐geodetic digraphs, A note on the restricted arc connectivity of oriented graphs of girth four, Restricted arc-connectivity of unidirectional star graphs, Strong articulation points and strong bridges in large scale graphs, \(\{2,3\}\)-extraconnectivities of hypercube-like networks, Restricted arc-connectivity of generalized \(p\)-cycles, Finding strong bridges and strong articulation points in linear time, \(\lambda^{\prime}\)-optimality of bipartite digraphs, On the restricted arc-connectivity of \(s\)-geodetic digraphs, Maximally edge-connected and vertex-connected graphs and digraphs: A survey, Cyclic arc-connectivity in a Cartesian product digraph, \(\lambda ^{\prime}\)-optimal digraphs, The restricted arc connectivity of Cartesian product digraphs, Arc fault tolerance of Cartesian product of regular digraphs on super-restricted arc-connectivity, Cartesian product digraphs with optimal restricted arc connectivity, 3-restricted arc connectivity of digraphs, On the optimality of 3-restricted arc connectivity for digraphs and bipartite digraphs, Bounds on the \(k\)-restricted arc connectivity of some bipartite tournaments, Arc fault tolerance of Kautz digraphs, Restricted arc connectivity of unidirectional hypercubes and unidirectional folded hypercubes, Restricted arc-connectivity in tournaments, Restricted arc-connectivity of bipartite tournaments, A new approach to finding the extra connectivity of graphs, Restricted connectivity of total digraph
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On computing a conditional edge-connectivity of a graph
- Sufficient conditions for \(\lambda'\)-optimality in graphs of diameter 2
- Conditional connectivity
- Fault tolerance measures for m-ary n-dimensional hypercubes based on forbidden faulty sets
- Sufficient conditions for graphs to be ??-optimal, super-edge-connected, and maximally edge-connected
- Sufficient conditions for λ′‐optimality in graphs with girth g
- On restricted edge-connectivity of graphs.
