A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is
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 problem concerns the smallest order of a k-geodetic mixed graph with given minimum undirected and directed degrees; this is a generalisation of the classical degree/girth problem. In this paper we present new bounds on the order of mixed graphs with given diameter or geodetic girth and exhibit new examples of directed andarXiv:2108.05820v1 fatcat:ureqqkqepnhvhcsgxhrn4nfuwi