Degree/diameter problem for mixed graphs
N López, H Pérez-Rosés - Procedia Computer Science, 2015 - Elsevier
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 …
degree. This problem has been extensively studied both for directed and undirected graphs …
A construction of dense mixed graphs of diameter 2
C Araujo-Pardo, C Balbuena, M Miller… - Electronic Notes in …, 2016 - Elsevier
A mixed graph is said to be dense, if its order is close to the Moore bound and it is optimal if
there is not a mixed graph with the same parameters and bigger order. We give a …
there is not a mixed graph with the same parameters and bigger order. We give a …
[PDF][PDF] Degree/diameter problem for mixed graphs
I López Lorenzo, H Pérez Rosés - 2015 - repositori.udl.cat
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 …
degree. This problem has been extensively studied both for directed and undirected graphs …