Mutually Independent Hamiltonian Cycles on Cartesian Product Graphs
碩士 === 國立暨南國際大學 === 資訊工程學系 === 101 === In a graph G, a cycle C = ⟨v0, v1, ..., vk, v0⟩ is defined as a sequence of adjacent vertices and for all 0 ≤ i < j ≤ k, vi ≠ vj ; a cycle is called Hamiltonian cycle if it contains all vertices of G. If there exists a Hamiltonian cycle in G, then G is a Ham...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2014
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/87009221373231109303 |