Then, it is proved that the complete graph of order 2n + 1 can be cyclically decomposed into k(2n + 1) cycles such that, for each i = 1, 2,...,k, the cycle ...
確定! 回上一頁