A mixed regular graph is a connected simple graph in which each vertex has both a fixed outdegree (the same indegree) and a fixed undirected degree. A mixed regular graphs is said to be optimal if there is not a mixed regular graph with the same parameters and bigger order. We present a construction that provides mixed graphs of undirected degree qq, directed degree View the MathML sourceq-12 and order 2q22q2, for qq being an odd prime power. Since the Moore bound for a mixed graph with these parameters is equal to View the MathML source9q2-4q+34 the defect of these mixed graphs is View the MathML source(q-22)2-14. In particular we obtain a known mixed Moore graph of order 1818, undirected degree 33 and directed degree 11 called Bosák’s gra...
Mixed almost Moore graphs appear in the context of the Degree/Diameter problem as a class of extrema...
AbstractThe Degree/diameter problem asks for the largest graphs given diameter and maximum degree. T...
The Moore bound for a directed graph of maximum out-degree d and diameter k is MC
A mixed regular graph is a connected simple graph in which each vertex has both a fixed outdegree (t...
A mixed graph is said to be <i>dense</i>, if its order is close to the Moore bound and it is <i>opti...
The degree-diameter problem seeks to find the maximum possible order of a graph with a given (maximu...
A mixed graph G can contain both (undirected) edges and arcs (directed edges). Here we derive an imp...
The undirected degree/diameter and degree/girth problems and their directed analogues have been stud...
The Moore bound for a directed graph of maximum out-degree d and diameter k is Md,k=1+d+d2++dk. It i...
A well-known fundamental problem in extremal graph theory is the degree/diameter problem, which is t...
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...
A natural upper bound for the maximum number of vertices in a mixed graph with maximum undirected de...
A well-known fundamental problem in extremal graph theory is the degree/diameter problem, which is t...
The degree/diameter problem for mixed graphs asks for the largest possible order of a mixed graph wi...
Mixed almost Moore graphs appear in the context of the Degree/Diameter problem as a class of extrema...
AbstractThe Degree/diameter problem asks for the largest graphs given diameter and maximum degree. T...
The Moore bound for a directed graph of maximum out-degree d and diameter k is MC
A mixed regular graph is a connected simple graph in which each vertex has both a fixed outdegree (t...
A mixed graph is said to be <i>dense</i>, if its order is close to the Moore bound and it is <i>opti...
The degree-diameter problem seeks to find the maximum possible order of a graph with a given (maximu...
A mixed graph G can contain both (undirected) edges and arcs (directed edges). Here we derive an imp...
The undirected degree/diameter and degree/girth problems and their directed analogues have been stud...
The Moore bound for a directed graph of maximum out-degree d and diameter k is Md,k=1+d+d2++dk. It i...
A well-known fundamental problem in extremal graph theory is the degree/diameter problem, which is t...
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...
A natural upper bound for the maximum number of vertices in a mixed graph with maximum undirected de...
A well-known fundamental problem in extremal graph theory is the degree/diameter problem, which is t...
The degree/diameter problem for mixed graphs asks for the largest possible order of a mixed graph wi...
Mixed almost Moore graphs appear in the context of the Degree/Diameter problem as a class of extrema...
AbstractThe Degree/diameter problem asks for the largest graphs given diameter and maximum degree. T...
The Moore bound for a directed graph of maximum out-degree d and diameter k is MC