Mutually Independent Hamiltonian Paths in (n, k)-Star Graphs
碩士 === 國立暨南國際大學 === 資訊工程學系 === 94 === Abstract Graphs and networks are often used interchangeably. There are many conflicting requirements in designing the topology for computer networks. The n-cube is one of the most popular topologies, and the topology of star network is attractive alternative t...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2006
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/98570604563784055537 |