On the restricted arc-connectivity of \(s\)-geodetic digraphs
From MaRDI portal
Publication:601919
DOI10.1007/S10114-010-9313-YzbMath1222.05111OpenAlexW1985660090MaRDI QIDQ601919
Camino Balbuena, Pedro García-Vázquez
Publication date: 29 October 2010
Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10114-010-9313-y
Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)
Related Items (9)
On the super‐restricted arc‐connectivity of s ‐geodetic digraphs ⋮ Restricted arc connectivity of unidirectional hypercubes and unidirectional folded hypercubes ⋮ Restricted arc-connectivity of unidirectional star graphs ⋮ \(\lambda^{\prime}\)-optimality of bipartite digraphs ⋮ Restricted arc-connectivity in tournaments ⋮ Restricted arc-connectivity of bipartite tournaments ⋮ 3-restricted arc connectivity of digraphs ⋮ A note on the restricted arc connectivity of oriented graphs of girth four ⋮ On the optimality of 3-restricted arc connectivity for digraphs and bipartite digraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- Diameter-girth sufficient conditions for optimal extraconnectivity in graphs
- Semisymmetric cubic graphs as regular covers of \(K_{3,3}\)
- \(k\) -factors in regular graphs
- \(\lambda ^{\prime}\)-optimal digraphs
- A structural theorem on embedded graphs and its application to colorings
- 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
- Conditional connectivity
- Sufficient conditions for λ′‐optimality in graphs with girth g
- The Two-Triangle Case of the Acquaintance Graph
- On restricted edge-connectivity of graphs.
This page was built for publication: On the restricted arc-connectivity of \(s\)-geodetic digraphs
