Show simple item record

dc.contributor.authorDalfó, Cristina
dc.date.accessioned2019-01-11T08:20:10Z
dc.date.available2019-09-15T22:16:06Z
dc.date.issued2017
dc.identifier.issn0024-3795
dc.identifier.urihttp://hdl.handle.net/10459.1/65488
dc.description.abstractWe show that the line digraph technique, when iterated, provides dense digraphs, that is, with asymptotically large order for a given diameter (or with small diameter for a given order). This is a well-known result for regular digraphs. In this note we prove that this is also true for non-regular digraphs.
dc.description.sponsorshipThis research is supported by projects MINECO MTM2014-60127-P, and 2014SGR1147 of the Catalan Government. This research has also received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Sk lodowska-Curie grant agreement No 734922.
dc.format.mimetypeapplication/pdf
dc.language.isoeng
dc.publisherElsevier
dc.relationMINECO/PN2013-2016/MTM2014-60127-P
dc.relation.isformatofVersió postprint del document publicat a https://doi.org/10.1016/j.laa.2017.04.036
dc.relation.ispartofLinear Algebra and its Applications, 2017, vol. 529, p. 391-396
dc.rightscc-by-nc-nd (c) Elsevier, 2017
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/
dc.subjectLine digraph
dc.subjectMoore digraph
dc.subjectDegree/diameter problem
dc.titleIterated line digraphs are asymptotically dense
dc.typeinfo:eu-repo/semantics/article
dc.date.updated2019-01-11T08:20:11Z
dc.identifier.idgrec028000
dc.type.versioninfo:eu-repo/semantics/acceptedVersion
dc.rights.accessRightsinfo:eu-repo/semantics/openAccess
dc.identifier.doihttps://doi.org/10.1016/j.laa.2017.04.036
dc.relation.projectIDinfo:eu-repo/grantAgreement/EC/H2020/734922/EU/CONNECT


Files in this item

Thumbnail
Thumbnail
Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

cc-by-nc-nd (c) Elsevier, 2017
Except where otherwise noted, this item's license is described as cc-by-nc-nd (c) Elsevier, 2017