A note on the restricted arc connectivity of oriented graphs of girth four
Combinatorics
2017-12-01 v1
Abstract
Let be a strongly connected digraph. An arc set of is a \emph{restricted arc-cut} of if has a non-trivial strong component such that contains an arc. The \emph{restricted arc-connectivity} of a digraph is the minimum cardinality over all restricted arc-cuts of . A strongly connected digraph is \emph{-connected} when exists. This paper presents a family of strong digraphs of girth four that are not -connected and for every strong digraph with girth four it follows that it is -connected. Also, an upper and lower bound for are given.
Cite
@article{arxiv.1711.11517,
title = {A note on the restricted arc connectivity of oriented graphs of girth four},
author = {D. González-Moreno and R. Hernández Ortiz},
journal= {arXiv preprint arXiv:1711.11517},
year = {2017}
}