Hamiltonian Decompositions of Recursive Circulant Graphs
碩士 === 國立交通大學 === 資訊科學系 === 88 === A k-regular graph G is hamiltonian decomposable if its edge-set can be partitioned into k/2 hamiltonian cycles when k is even or (k-1)/2 hamiltonian cycles and a perfect matching when k is odd. In this paper, we prove that every recursive circulant gr...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_US |
Published: |
2000
|
Online Access: | http://ndltd.ncl.edu.tw/handle/26045657867042044696 |