A note on the restricted arc connectivity of oriented graphs of girth four
Let D be a strongly connected digraph. An arc set S of D is a restricted arc-cut of D if D − S has a non-trivial strong component D1 such that D − V (D1) contains an arc. The restricted arc-connectivity λ(D) of a digraph D is the minimum cardinality over all restricted arc-cuts of D. A strongly conn...
| Autor: | |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2018 |
| País: | México |
| Institución: | Universidad Autónoma Metropolitana |
| Repositorio: | Concentración de Recursos de Información Científica y Académica, UAM Cuajimalpa |
| Idioma: | inglés |
| OAI Identifier: | oai:ilitia.cua.uam.mx:123456789/679 |
| Acceso en línea: | http://ilitia.cua.uam.mx:8080/jspui/handle/123456789/679 |
| Access Level: | acceso abierto |
| Palabra clave: | info:eu-repo/classification/cti/1 Conectividad Gráficos orientados Circunferencia cuatro |
| Sumario: | Let D be a strongly connected digraph. An arc set S of D is a restricted arc-cut of D if D − S has a non-trivial strong component D1 such that D − V (D1) contains an arc. The restricted arc-connectivity λ(D) of a digraph D is the minimum cardinality over all restricted arc-cuts of D. A strongly connected digraph D is λ-connected when λ(D) exists. This paper presents a family F of strong digraphs of girth four that are not λ-connected and for every strong digraph D /∈ F with girth four it follows that it is λ-connected. Also, an upper and lower bound for λ(D) are given. |
|---|