Sciweavers

2 search results - page 1 / 1
» Pancyclicity of recursive circulant graphs
Sort
View
IPL
2002
71views more  IPL 2002»
13 years 4 months ago
Pancyclicity of recursive circulant graphs
In this paper, we study the existence of cycles of all lengths in the recursive circulant graphs, and we show a necessary and sufficient condition for the graph being pancyclic an...
Toru Araki, Yukio Shibata
DM
2000
88views more  DM 2000»
13 years 4 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