On the Total Regularity of Almost Mixed Moore Graphs
The degree/diameter problem asks for the largest order of a graph with a given diameter and maximum vertex degree. This has been widely studied and given rise to a recent variation for mixed graphs (graphs with both undirected edges and directed arcs), where an additional bound is placed on the maximum directed out-deg...