|
Title:
|
Bounds on the k-restricted arc connectivity of some bipartite tournaments
|
|
Author:
|
Balbuena Martínez, Maria Camino Teófila; González Moreno, Diego; Olsen, Mika
|
|
Other authors:
|
Universitat Politècnica de Catalunya. Departament d'Enginyeria Civil i Ambiental; Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions |
|
Abstract:
|
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. |
|
Abstract:
|
Peer Reviewed |
|
Subject(s):
|
-À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 |
|
Rights:
|
|
|
Document type:
|
Article - Submitted version
Article |
|
Share:
|
|
