The degree/diameter problem for mixed graphs asks for the largest possible order of a
mixed graph with given diameter and degree parameters. Similarly the degree/geodecity …

Mixed almost Moore graphs appear in the context of the Degree/Diameter problem as a
class of extremal mixed graphs, in the sense that their order is one less than the Moore …

We introduce the notion of az, r; g-mixed cage. A z, r; g-mixed cage is a mixed graph G, z-
regular by arcs, r-regular by edges, with girth g and minimum order. In this paper we prove …

A mixed graph can be seen as a type of digraph containing some edges (or two opposite
arcs). Here we introduce the concept of sequence mixed graphs, which is a generalization of …

The degree-diameter problem seeks to find the largest possible number of vertices in a
graph having given diameter and given maximum degree. There has been much recent …

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 …

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 …

Abstract An (r, z, k)-mixed graph G has every vertex with undirected degree r, directed in-and
out-degree z, and diameter k. In this paper, we study the case r= z= 1, proposing some new …

A Neumaier graph is a non-complete edge-regular graph containing a regular clique. In this
work, we prove several results on the existence of small strictly Neumaier graphs. In …

A natural upper bound for the maximum number of vertices in a mixed graph with maximum
undirected degree r, maximum directed out-degree z and diameter k is given by the mixed …