The Embedding of Hamiltonian Paths in Faulty Arrangement Graphs
博士 === 國立臺灣大學 === 資訊工程學研究所 === 88 === The arrangement graph, which represents a family of scalable graphs, is a generalization of the star graph. There are two parameters, denoted by n and k, for the arrangement graph, where 1kn-1. An (n, k)-arrangement graph, which is denoted by An,k, has vertice...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2000
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/39670745267090062787 |