Báo cáo khoa học 演講訊息

Let G=(V,E) be a graph, N=|V|, and V={v(i)| i=1, 2, 3, …, N}. G is Hamiltoninan if G contains a cycle that visits v(i) exactly once for all 1<=i<=N. We say “G contains m mutually independent hamiltonian cycles” if G contains m Hamiltonian cycles such that for some vertex , and . Recently, there are numerous studies about the existence of mutually independent Hamiltonian cycles in interconnection networks. In this talk, we will review and compare the different construction schemes of mutually independent Hamiltonian cycles in various networks, derive a degree-based theoretical properties, and introduce our current work.