Show simple item record

dc.contributor.authorDalfó, Cristina
dc.contributor.authorFiol, Miguel Angel
dc.description.abstractWe 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.sponsorshipThis 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.publisherIndonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesiaca_ES
dc.relation.isformatofReproducció del document publicat a
dc.relation.ispartofElectronic Journal of Graph Theory and Applications, 2014, vol. 2, núm. 1, p. 1–17ca_ES
dc.rightscc-by-sa (c) C. Dalfo et al., 2014ca_ES
dc.subject(Delta,D) problemca_ES
dc.subject(Delta,N) problemca_ES
dc.subjectUnilateral diameterca_ES
dc.subjectDouble-step digraphca_ES
dc.titleThe (∆,D) and (∆,N) problems in double-step digraphs with unilateral distanceca_ES

Files in this item


This item appears in the following Collection(s)

Show simple item record

cc-by-sa (c) C. Dalfo et al., 2014
Except where otherwise noted, this item's license is described as cc-by-sa (c) C. Dalfo et al., 2014