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
The degree/diameter problem is to determine the largest graphs or digraphs of given maximum degree a...
This paper discusses the most popular algebraic techniques and computational methods that have been ...
The degree/diameter problem is to determine the largest graphs or digraphs of given maximum degree a...
AbstractThe Degree/diameter problem asks for the largest graphs given diameter and maximum degree. T...
A well-known fundamental problem in extremal graph theory is the degree/diameter problem, which is t...
A well-known fundamental problem in extremal graph theory is the degree/diameter problem, which is t...
The degree-diameter problem seeks to find the maximum possible order of a graph with a given (maximu...
The undirected degree/diameter and degree/girth problems and their directed analogues have been stud...
Mixed almost Moore graphs appear in the context of the Degree/Diameter problem as a class of extrema...
A mixed graph G can contain both (undirected) edges and arcs (directed edges). Here we derive an imp...
The Degree/Diameter Problem is an extremal problem in graph theory with applications in network desi...
A mixed regular graph is a connected simple graph in which each vertex has both a fixed outdegree (t...
Mixed graphs can be seen as digraphs that have both arcs and edges (or digons, that is, two opposite...
A new general family of mixed graphs is presented, which generalizes both the pancake graphs and the...
A natural upper bound for the maximum number of vertices in a mixed graph with maximum undirected de...
The degree/diameter problem is to determine the largest graphs or digraphs of given maximum degree a...
This paper discusses the most popular algebraic techniques and computational methods that have been ...
The degree/diameter problem is to determine the largest graphs or digraphs of given maximum degree a...
AbstractThe Degree/diameter problem asks for the largest graphs given diameter and maximum degree. T...
A well-known fundamental problem in extremal graph theory is the degree/diameter problem, which is t...
A well-known fundamental problem in extremal graph theory is the degree/diameter problem, which is t...
The degree-diameter problem seeks to find the maximum possible order of a graph with a given (maximu...
The undirected degree/diameter and degree/girth problems and their directed analogues have been stud...
Mixed almost Moore graphs appear in the context of the Degree/Diameter problem as a class of extrema...
A mixed graph G can contain both (undirected) edges and arcs (directed edges). Here we derive an imp...
The Degree/Diameter Problem is an extremal problem in graph theory with applications in network desi...
A mixed regular graph is a connected simple graph in which each vertex has both a fixed outdegree (t...
Mixed graphs can be seen as digraphs that have both arcs and edges (or digons, that is, two opposite...
A new general family of mixed graphs is presented, which generalizes both the pancake graphs and the...
A natural upper bound for the maximum number of vertices in a mixed graph with maximum undirected de...
The degree/diameter problem is to determine the largest graphs or digraphs of given maximum degree a...
This paper discusses the most popular algebraic techniques and computational methods that have been ...
The degree/diameter problem is to determine the largest graphs or digraphs of given maximum degree a...
DOI
Add to ORKG