dc.contributor.author
Dalfó, Cristina
dc.date.accessioned
2024-12-05T21:28:53Z
dc.date.available
2024-12-05T21:28:53Z
dc.date.issued
2019-01-11T08:20:10Z
dc.date.issued
2019-09-15T22:16:06Z
dc.date.issued
2019-01-11T08:20:11Z
dc.identifier
https://doi.org/10.1016/j.laa.2017.04.036
dc.identifier
http://hdl.handle.net/10459.1/65488
dc.identifier.uri
http://hdl.handle.net/10459.1/65488
dc.description.abstract
We 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.abstract
This 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
application/pdf
dc.relation
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/
dc.relation
Versió postprint del document publicat a https://doi.org/10.1016/j.laa.2017.04.036
dc.relation
Linear Algebra and its Applications, 2017, vol. 529, p. 391-396
dc.relation
info:eu-repo/grantAgreement/EC/H2020/734922/EU/CONNECT
dc.rights
cc-by-nc-nd (c) Elsevier, 2017
dc.rights
info:eu-repo/semantics/openAccess
dc.rights
http://creativecommons.org/licenses/by-nc-nd/4.0/
dc.subject
Degree/diameter problem
dc.title
Iterated line digraphs are asymptotically dense
dc.type
info:eu-repo/semantics/article
dc.type
info:eu-repo/semantics/acceptedVersion
