FUTUR. Website for the scientific production of UPC researchers.

A new general family of mixed graphs

Author: Dalfo, C.

Type of activity: Journal article
Journal: Discrete applied mathematics
Date of publication: 2019-01-11
DOI: https://doi.org/10.1016/j.dam.2018.12.016
Project funding: 2017SGR1087 - Combinatòria, Teoria de Grafs i Aplicacions
Combinatorics of networks and computation

Repository: http://hdl.handle.net/2117/127568
URL: https://www.sciencedirect.com/science/article/pii/S0166218X18306590
Abstract: 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) diameter for their number of vertices
Citation: Dalfo, C. A new general family of mixed graphs. "Discrete applied mathematics", 11 Gener 2019.
Keywords: Cycle prefix digraph, Degree/diameter problem, Diameter, Mean distance, Mixed graph, Moore bound, Pancake graph

Group of research: COMBGRAPH - Combinatorics, Graph Theory and Applications