Hamiltonian factorization of the product of a complete graph with itself
Basil R. Myers · Networks · 1972
Abstract It is shown that the product Knx Kn, where Kn is the complete graph of order n, is the sum of n‐1 spanning cycles. Regarded as a communication net, Knx Kn is then optimally invulnerable to line damage.