Hamilton cycles in tensor product of graphs
暂无分享,去创建一个
Abstract In this paper, we characterize graphs G for which G⊗K2 is Hamiltonian, where ⊗ denotes the tensor product of graphs. The relationship between the bieulerian orientation of a 4-regular graph G and the existence of a pair of edge-disjoint Hamilton cycles in G⊗K2 is established. Also a characterization for a 4-regular graph to have a bieulerian orientation is presented. Finally, some conjectures of Jha relating to the existence of cycles or edge-disjoint Hamilton cycles are either proved or disproved.
[1] J. A. Bondy,et al. Graph Theory with Applications , 1978 .
[2] H. Fleischner. Eulerian graphs and related topics , 1990 .
[3] Frank Harary,et al. Graph Theory , 2016 .
[4] Marsha F. Foregger. Hamiltonian decompositions of products of cycles , 1978, Discret. Math..
[5] Kenneth A. BERMAN. Aneulerian digraphs and the determination of those Eulerian digraphs having an odd number of directed Eulerian paths , 1978, Discret. Math..