Degree/diameter Problem for Mixed Graphs
Nacho López, Hebert Pérez‐Rosés · Procedia Computer Science · 2015
The Degree/diameter problem asks for the largest graphs given diameter and maximum degree. This problem has been extensively studied both for directed and undirected graphs, ando also for special classes of graphs. In this work we present the state of art of the degree/diameter problem for mixed graphs.