On the super‐restricted arc‐connectivity of s ‐geodetic digraphs
From MaRDI portal
Publication:5326776
DOI10.1002/net.21462zbMath1269.05043OpenAlexW2123896763MaRDI QIDQ5326776
Camino Balbuena, Luis Pedro Montejano, Adriana Hansberg, Pedro García-Vázquez
Publication date: 6 August 2013
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.21462
Related Items (8)
Arc fault tolerance of Cartesian product of regular digraphs on super-restricted arc-connectivity ⋮ Restricted arc-connectivity of unidirectional star graphs ⋮ Restricted arc-connectivity of generalized \(p\)-cycles ⋮ \(\lambda^{\prime}\)-optimality of bipartite digraphs ⋮ 3-restricted arc connectivity of digraphs ⋮ A note on the restricted arc connectivity of oriented graphs of girth four ⋮ Bounds on the \(k\)-restricted arc connectivity of some bipartite tournaments ⋮ On the optimality of 3-restricted arc connectivity for digraphs and bipartite digraphs
Cites Work
- Unnamed Item
- Unnamed Item
- On the restricted arc-connectivity of \(s\)-geodetic digraphs
- Diameter, short paths and superconnectivity in digraphs
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- Diameter-girth sufficient conditions for optimal extraconnectivity in graphs
- \(\lambda ^{\prime}\)-optimal digraphs
- The restricted arc connectivity of Cartesian product digraphs
- Diameter-sufficient conditions for a graph to be super-restricted connected
- Sur la séparation dans les graphes de Cayley abéliens
- On computing a conditional edge-connectivity of a graph
- A property of a-fragments of a digraph
- Extraconnectivity of \(s\)-geodetic digraphs and graphs
- Extraconnectivity of graphs with large girth
- Extraconnectivity of graphs with large minimum degree and girth
- On the order and size of \(s\)-geodetic digraphs with given connectivity
- Conditional edge connectivity properties, reliability comparisons and transitivity of graphs
- On the extraconnectivity of graphs
- Restricted arc-connectivity of digraphs
- On the linegraph of a directed-graph
- A proof of an inequality concerning \(k\)-restricted edge connectivity
- Edge cuts leaving components of order at least \(m\)
- Line Digraph Iterations and the (d, k) Digraph Problem
- Circulants and their connectivities
- Conditional connectivity
- Synthesis of reliable networks - a survey
- Superconnected digraphs and graphs with small conditional diameters
- Sufficient conditions for λ′‐optimality in graphs with girth g
- Minimally strong digraphs
- On restricted edge-connectivity of graphs.
This page was built for publication: On the super‐restricted arc‐connectivity of s ‐geodetic digraphs
