On Arc-fault Tolerant Hamiltonian Property of Some Circulant Diregular Tournaments
碩士 === 輔仁大學 === 數學系研究所 === 87 === Kelly conjectured that any digraph tournament is hamiltonian decomposable. However it seems that no strong evidence exist to support it. In this thesis we study a class of circulant n-diregular tournaments, denoted by Hn....
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
1999
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/97119573608203832338 |
| Summary: | 碩士 === 輔仁大學 === 數學系研究所 === 87 === Kelly conjectured that any digraph tournament is hamiltonian decomposable.
However it seems that no strong evidence exist to support it.
In this thesis we study a class of circulant n-diregular tournaments, denoted by Hn.
We show that Hn is hamiltonian decomposable when 2n+1 is a prime.
Also we prove that Hn is (n-1)-arc-fault tolerant hamiltonian.
(Note that if Kelly's conjecture is true, then any n-diregular tournament is
(n-1)-arc-fault tolerant hamiltonian.)
|
|---|