2026-04-14T06:41:07Zhttps://recercat.cat/oai/request

oai:recercat.cat:2117/1254892026-02-02T10:10:27Zcom_2072_1033col_2072_452950

00925njm 22002777a 4500 dc Balbuena Martínez, Maria Camino Teófila author González Moreno, Diego author Olsen, Mika author 2018-08-15 For k¿=¿2, a strongly connected digraph D is called -connected if it contains a set of arcs W such that contains at least k non-trivial strong components. The k-restricted arc connectivity of a digraph D was defined by Volkmann as . In this paper we bound for a family of bipartite tournaments T called projective bipartite tournaments. We also introduce a family of “good” bipartite oriented digraphs. For a good bipartite tournament T we prove that if the minimum degree of T is at least then where N is the order of the tournament. As a consequence, we derive better bounds for circulant bipartite tournaments. Peer Reviewed Postprint (author's final draft) Àrees temàtiques de la UPC::Matemàtiques i estadística::Anàlisi numèrica Numerical analysis Digraphs Bipartite Tournament Projective plane Anàlisi numèrica Classificació AMS::65 Numerical analysis::65Y Computer aspects of numerical algorithms Bounds on the k-restricted arc connectivity of some bipartite tournaments