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 |
id |
ndltd-TW-102NCYU5392003 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-102NCYU53920032016-05-22T04:34:30Z http://ndltd.ncl.edu.tw/handle/08763587546134868988 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 Hamiltonian cycles {C1, C2,...,Ck} of G is mutually independent if its elements are pairwise independent. The mutually independent hamiltonicity IHC(G) of a graph G is the maximum cardinality of the set of mutually independent Hamiltonian cycle starting from any vertex of G. A chordal rings graph CR(n,d) is a graph with n vertices {0,1,2,...,n-1} and 2n edges such that vertex i is adjacent with vertices (i+1)(mod n) and (i+d)(mod n). This thesis considered the mutually independent hamiltonicity of chordal rings G and showed the sufficient and necessary condition for IHC(G)=4 . 賴泳伶 學位論文 ; thesis 0 zh-TW |
collection |
NDLTD |
language |
zh-TW |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立嘉義大學 === 資訊工程學系研究所 === 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 Hamiltonian cycles {C1, C2,...,Ck} of G is mutually independent if its elements are pairwise independent. The mutually independent hamiltonicity IHC(G) of a graph G is the maximum cardinality of the set of mutually independent Hamiltonian cycle starting from any vertex of G. A chordal rings graph CR(n,d) is a graph with n vertices {0,1,2,...,n-1} and 2n edges such that vertex i is adjacent with vertices (i+1)(mod n) and (i+d)(mod n). This thesis considered the mutually independent hamiltonicity of chordal rings G and showed the sufficient and necessary condition for IHC(G)=4 .
|
author2 |
賴泳伶 |
author_facet |
賴泳伶 謝勝宇 |
author |
謝勝宇 |
spellingShingle |
謝勝宇 The Mutually Independent Hamiltonian Cycles of Chordal Rings |
author_sort |
謝勝宇 |
title |
The Mutually Independent Hamiltonian Cycles of Chordal Rings |
title_short |
The Mutually Independent Hamiltonian Cycles of Chordal Rings |
title_full |
The Mutually Independent Hamiltonian Cycles of Chordal Rings |
title_fullStr |
The Mutually Independent Hamiltonian Cycles of Chordal Rings |
title_full_unstemmed |
The Mutually Independent Hamiltonian Cycles of Chordal Rings |
title_sort |
mutually independent hamiltonian cycles of chordal rings |
url |
http://ndltd.ncl.edu.tw/handle/08763587546134868988 |
work_keys_str_mv |
AT xièshèngyǔ themutuallyindependenthamiltoniancyclesofchordalrings AT xièshèngyǔ xiánhuánshìwǎnglùzhōngzhīxiānghùdúlìdehànmǐěrdùnquān AT xièshèngyǔ mutuallyindependenthamiltoniancyclesofchordalrings |
_version_ |
1718275625855221760 |