For graphs with maximum degree d and diameter k, an upper bound on the number of vertices in the graphs is provided by the well-known Moore ...
確定! 回上一頁