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 verticesPeer ReviewedPostprint (author's final draft
A well-known fundamental problem in extremal graph theory is the degree/diameter problem, which is t...
A mixed graph can be seen as a type of digraph containing some edges (or two opposite arcs). Here we...
A natural upper bound for the maximum number of vertices in a mixed graph with maximum undirected de...
A new general family of mixed graphs is presented, which generalizes both the pancake graphs and the...
A mixed regular graph is a connected simple graph in which each vertex has both a fixed outdegree (t...
A mixed graph G can contain both (undirected) edges and arcs (directed edges). Here we derive an imp...
The Degree/diameter problem asks for the largest graphs given diameter and maximum degree. This prob...
AbstractThe Degree/diameter problem asks for the largest graphs given diameter and maximum degree. T...
Mixed graphs can be seen as digraphs that have both arcs and edges (or digons, that is, two opposite...
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...
A well-known fundamental problem in extremal graph theory is the degree/diameter problem, which is t...
Mixed graphs can be seen as digraphs that have both arcs and edges (or digons, that is, two opposite...
Mixed almost Moore graphs appear in the context of the Degree/Diameter problem as a class of extrema...
The final publication is available at Springer via http://dx.doi.org/10.1007/s00026-020-00496-2Mixed...
A well-known fundamental problem in extremal graph theory is the degree/diameter problem, which is t...
A mixed graph can be seen as a type of digraph containing some edges (or two opposite arcs). Here we...
A natural upper bound for the maximum number of vertices in a mixed graph with maximum undirected de...
A new general family of mixed graphs is presented, which generalizes both the pancake graphs and the...
A mixed regular graph is a connected simple graph in which each vertex has both a fixed outdegree (t...
A mixed graph G can contain both (undirected) edges and arcs (directed edges). Here we derive an imp...
The Degree/diameter problem asks for the largest graphs given diameter and maximum degree. This prob...
AbstractThe Degree/diameter problem asks for the largest graphs given diameter and maximum degree. T...
Mixed graphs can be seen as digraphs that have both arcs and edges (or digons, that is, two opposite...
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...
A well-known fundamental problem in extremal graph theory is the degree/diameter problem, which is t...
Mixed graphs can be seen as digraphs that have both arcs and edges (or digons, that is, two opposite...
Mixed almost Moore graphs appear in the context of the Degree/Diameter problem as a class of extrema...
The final publication is available at Springer via http://dx.doi.org/10.1007/s00026-020-00496-2Mixed...
A well-known fundamental problem in extremal graph theory is the degree/diameter problem, which is t...
A mixed graph can be seen as a type of digraph containing some edges (or two opposite arcs). Here we...
A natural upper bound for the maximum number of vertices in a mixed graph with maximum undirected de...
DOI
Add to ORKG