A new general family of mixed graphs is presented, which generalizes both the pancake graphs and the cycle prefix digraphs. The obtained graphs are vertex transitive and, for some values of the parameters, they constitute the best infinite families with asymptotically optimal (or quasi-optimal) number of vertices for their diameter.
This research has been partially supported by AGAUR under project 2017SGR1087. 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.
English
Mixed graph; Pancake graph; Cycle prefix digraph
Elsevier
Versió postprint del document publicat a https://doi.org/10.1016/j.dam.2018.12.016
Discrete Applied Mathematics, 2019, vol. 269, p. 99-106
info:eu-repo/grantAgreement/EC/H2020/734922/EU/CONNECT
cc-by-nc-nd (c) Elsevier, 2018
http://creativecommons.org/licenses/by-nc-nd/4.0/
Documents de recerca [17848]