## The (∆,D) and (∆,N) problems in double-step digraphs with unilateral distance

 dc.contributor.author Dalfó, Cristina dc.contributor.author Fiol Mora, Miguel Ángel dc.date.accessioned 2019-02-04T08:26:35Z dc.date.available 2019-02-04T08:26:35Z dc.date.issued 2014 dc.description.abstract We study the (Delta,D) and (Delta,N) problems for double-step digraphs considering the unilateral distance, which is the minimum between the distance in the digraph and the distance in its converse digraph, obtained by changing the directions of all the arcs. The first problem consists of maximizing the number of vertices N of a digraph, given the maximum degree $\Delta$ and the unilateral diameter D*, whereas the second one (somehow dual of the first) consists of minimizing the unilateral diameter given the maximum degree and the number of vertices. We solve the first problem for every value of the unilateral diameter and the second one for infinitely many values of the number of vertices. Moreover, we compute the mean unilateral distance of the digraphs in the families considered. ca_ES dc.description.sponsorship This research was supported by the Ministry of Science and Innovation (Spain) and the European Regional Development Fund under project MTM2011-28800-C02-01-1 and by the Catalan Research Council under project 2009SGR1387. ca_ES dc.identifier.doi https://doi.org/10.5614/ejgta.2014.2.1.1 dc.identifier.idgrec 028096 dc.identifier.issn 2338-2287 dc.identifier.uri http://hdl.handle.net/10459.1/65705 dc.language.iso eng ca_ES dc.publisher Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia ca_ES dc.relation info:eu-repo/grantAgreement/MICINN//MTM2011-28800-C02-01/ES/OPTIMIZACION Y PROBLEMAS EXTREMALES EN TEORIA DE GRAFOS Y COMBINATORIA. APLICACIONES A LAS REDES DE COMUNICACION/ dc.relation.isformatof Reproducció del document publicat a https://doi.org/10.5614/ejgta.2014.2.1.1 ca_ES dc.relation.ispartof Electronic Journal of Graph Theory and Applications, 2014, vol. 2, núm. 1, p. 1–17 ca_ES dc.rights cc-by-sa (c) C. Dalfo et al., 2014 ca_ES dc.rights.accessRights info:eu-repo/semantics/openAccess ca_ES dc.rights.uri http://creativecommons.org/licenses/by-sa/4.0/ * dc.subject (Delta,D) problem ca_ES dc.subject (Delta,N) problem ca_ES dc.subject Unilateral diameter ca_ES dc.subject Double-step digraph ca_ES dc.title The (∆,D) and (∆,N) problems in double-step digraphs with unilateral distance ca_ES dc.type info:eu-repo/semantics/article ca_ES dc.type.version info:eu-repo/semantics/publishedVersion ca_ES
##### Original bundle
Now showing 1 - 1 of 1
Name:
028096.pdf
Size:
568.68 KB
Format: