Mostra el registre d'ítem simple
Bounds on the k-restricted arc connectivity of some bipartite tournaments
dc.contributor.author | Balbuena Martínez, Maria Camino Teófila |
dc.contributor.author | González Moreno, Diego |
dc.contributor.author | Olsen, Mika |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament d'Enginyeria Civil i Ambiental |
dc.date.accessioned | 2018-12-07T09:35:15Z |
dc.date.available | 2020-08-01T00:32:40Z |
dc.date.issued | 2018-08-15 |
dc.identifier.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. |
dc.identifier.issn | 0096-3003 |
dc.identifier.uri | http://hdl.handle.net/2117/125489 |
dc.description.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. |
dc.format.extent | 7 p. |
dc.language.iso | eng |
dc.subject | Àrees temàtiques de la UPC::Matemàtiques i estadística::Anàlisi numèrica |
dc.subject.lcsh | Numerical analysis |
dc.subject.other | Digraphs |
dc.subject.other | Bipartite |
dc.subject.other | Tournament |
dc.subject.other | Projective plane |
dc.title | Bounds on the k-restricted arc connectivity of some bipartite tournaments |
dc.type | Article |
dc.subject.lemac | Anàlisi numèrica |
dc.contributor.group | Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions |
dc.identifier.doi | 10.1016/j.amc.2018.02.038 |
dc.description.peerreviewed | Peer Reviewed |
dc.subject.ams | Classificació AMS::65 Numerical analysis::65Y Computer aspects of numerical algorithms |
dc.relation.publisherversion | https://www.sciencedirect.com/science/article/abs/pii/S0096300318301486 |
dc.rights.access | Open Access |
local.identifier.drac | 22517932 |
dc.description.version | Postprint (author's final draft) |
dc.relation.projectid | info:eu-repo/grantAgreement/MINECO//MTM2014-60127-P/ES/TECNICAS DE OPTIMIZACION EN TEORIA DE GRAFOS, GRUPOS Y COMBINATORIA. APLICACIONES A REDES, ALGORITMOS Y PROTOCOLOS DE COMUNICACION./ |
local.citation.author | Balbuena, C.; González, D.; Olsen, M. |
local.citation.publicationName | Applied mathematics and computation |
local.citation.volume | 331 |
local.citation.startingPage | 54 |
local.citation.endingPage | 60 |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Articles de revista [3.002]
-
Articles de revista [290]