Edge exchanges in hamiltonian decompositions of Kronecker-product graphs

摘要: Abstract Let G be a connected graph on n vertices, and let α, β, γ δ edge-disjoint cycles in such that 1. (i) β (respectively, γ, δ) are vertex-disjoint 2. (ii) | Ga + = , where α denotes the length of α. We say yield two Hamiltonian by edge exchanges if four respectively contain edges e f g h each ( − ) ∪ g,h e,f constitutes cycle . show is nonbipartite, decomposable an even number vertices which satisfies certain conditions, then Kronecker product K 2 as well admits decomposition means appropriate among smaller graph.