| 英文摘要 |
In this paper, we completely solve the problem of finding a maximum packing of Km × Kn, the Cartesian product of two complete graphs, with edge-disjoint 5-cycles and minimum leaves are explicitly given. Subsequently, we also find a minimum covering of Km × Kn. |
本站僅提供期刊文獻檢索。
