| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 429119 | Information Processing Letters | 2009 | 6 Pages |
Abstract
In 1987, Akers, Harel and Krishnamurthy proposed the star graph Σ(n) as a new topology for interconnection networks. Hamiltonian properties of these graphs have been investigated by several authors. In this paper, we prove that Σ(n) contains ⌊n/8⌋ pairwise edge-disjoint Hamilton cycles when n is prime, and Ω(n/loglogn) such cycles for arbitrary n.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
