Sciweavers

Share
DM
2000

Hamiltonian decomposition of recursive circulant graphs

8 years 11 months ago
Hamiltonian decomposition of recursive circulant graphs
The graph G(N; d) has vertex set V = {0; 1; : : : ; N - 1}, with {v; w} an edge if v - w
Daniel K. Biss
Added 18 Dec 2010
Updated 18 Dec 2010
Type Journal
Year 2000
Where DM
Authors Daniel K. Biss
Comments (0)
books