The Existence of Non-trivial Vertex Transitive and Edge Transitive 4-ordered Hamiltonian and 4-ordered Hamiltonian laceable Cubic Graph
碩士 === 靜宜大學 === 資訊工程學系 === 102 === A cubic graph is a graph with every vertex of degree 3. A graph is k-ordered hamiltonian if for every ordered set S of k vertices there exists a Hamiltonian cycle which encounters S in its designated order. A graph is k-ordered Hamiltonian connected if for every k...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2013
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/56325315751166427230 |