Loading...
Loading...

Go to the content (press return)

Bounds on the k-restricted arc connectivity of some bipartite tournaments

Author
Balbuena, C.; González, D.; Olsen, M.
Type of activity
Journal article
Journal
Applied mathematics and computation
Date of publication
2018-08-15
Volume
331
First page
54
Last page
60
DOI
https://doi.org/10.1016/j.amc.2018.02.038 Open in new window
Project funding
Optimization techniques in graph theory, groups, and combinatorics. Applications to networks, algorithms, and communication protocols
Repository
http://hdl.handle.net/2117/125489 Open in new window
URL
https://www.sciencedirect.com/science/article/abs/pii/S0096300318301486 Open in new window
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 t...
Citation
Balbuena, C., González, D., Olsen, M. Bounds on the k-restricted arc connectivity of some bipartite tournaments. "Applied mathematics and computation", 15 Agost 2018, vol. 331, p. 54-60.
Keywords
Bipartite, Digraphs, Projective plane, Tournament
Group of research
COMBGRAPH - Combinatorics, Graph Theory and Applications

Participants