The Mutually Independent Hamiltonian Cycles of Chordal Rings
碩士 === 國立嘉義大學 === 資訊工程學系研究所 === 102 === Let G=(V,E) be a graph of order n. A Hamiltonian cycle of G is a cycle that contains every vertex in G. Two Hamiltonian cycles C1=<u1,u2,...,un,u1> and C2=<v1,v2,...,vn,v1> of G are independent if u1=v1 and ui=vi for 2<=i<=n. A set of Hami...
Main Author: | 謝勝宇 |
---|---|
Other Authors: | 賴泳伶 |
Format: | Others |
Language: | zh-TW |
Online Access: | http://ndltd.ncl.edu.tw/handle/08763587546134868988 |
Similar Items
-
The mutually independent hamiltonian cycles of graphs
by: Da-Chung Yu, et al.
Published: (2011) -
On the Height of Independent Spanning Trees in Chordal Rings
by: Jing Xian Lee, et al.
Published: (2001) -
Completely independent spanning trees on chordal rings
by: Sing-Chen Yao, et al.
Published: (2013) -
Mutually Independent Hamiltonian Cycles on Arrangement Graphs
by: Cheng-Da Lin, et al.
Published: (2011) -
Mutually Independent Hamiltonian Cycles on Cartesian Product Graphs
by: Kai-Siou Wu, et al.
Published: (2014)