Universitat de Lleida
A mixed graph can be seen as a type of digraph containing some edges (or two opposite arcs). Here we introduce the concept of sequence mixed graphs, which is a generalization of both sequence graphs and iterated line digraphs. These structures are proven to be useful in the problem of constructing dense graphs or digraphs, and this is related to the degree/diameter problem. Thus, our generalized approach gives rise to graphs that have also good ratio order/diameter. Moreover, we propose a general method for obtaining a sequence mixed digraph by identifying some vertices of a certain iterated line digraph. As a consequence, some results about distance-related parameters (mainly, the diameter and the average distance) of sequence mixed graphs are presented.
This research is supported by the Ministerio de Ciencia e Innovación, and the European Regional Development Fund under project MTM2014-60127-P (C. D. and M. A. F.), the Catalan Research Council under project 2014SGR1147 (C. D. and M. A. F.). The author N. L. has been supported in part by grant MTM2013-46949-P, from Ministerio de Economía y Competitividad, Spain
Anglès
Mixed graph; Sequence graph; Line 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/
info:eu-repo/grantAgreement/MINECO//MTM2013-46949-P/ES/CRIPTOGRAFIA CON CURVAS ALGEBRAICAS PARA LA E-SOCIEDAD/
Versió postprint del document publicat a https://doi.org/10.1016/j.dam.2016.10.030
Discrete Applied Mathematics, 2017, num. 219, p. 110-116
cc-by-nc-nd (c) Elsevier, 2017
http://creativecommons.org/licenses/by-nc-nd/4.0/
Documents de recerca [17848]
