English

A note on the restricted arc connectivity of oriented graphs of girth four

Combinatorics 2017-12-01 v1

Abstract

Let DD be a strongly connected digraph. An arc set SS of DD is a \emph{restricted arc-cut} of DD if DSD-S has a non-trivial strong component D1D_{1} such that DV(D1)D-V(D_{1}) contains an arc. The \emph{restricted arc-connectivity} λ(D)\lambda'(D) of a digraph DD is the minimum cardinality over all restricted arc-cuts of DD. A strongly connected digraph DD is \emph{λ\lambda'-connected} when λ(D)\lambda'(D) exists. This paper presents a family F\cal{F} of strong digraphs of girth four that are not λ\lambda'-connected and for every strong digraph DFD\notin \cal{F} with girth four it follows that it is λ\lambda'-connected. Also, an upper and lower bound for λ(D)\lambda'(D) are given.

Keywords

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}
}