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.
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.
Inglés
Line digraph; Moore digraph; Degree/diameter problem
Elsevier
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/
Versió postprint del document publicat a https://doi.org/10.1016/j.laa.2017.04.036
Linear Algebra and its Applications, 2017, vol. 529, p. 391-396
info:eu-repo/grantAgreement/EC/H2020/734922/EU/CONNECT
cc-by-nc-nd (c) Elsevier, 2017
http://creativecommons.org/licenses/by-nc-nd/4.0/
Documents de recerca [17848]