Sciweavers

632 search results - page 3 / 127
» On Routing in Circulant Graphs
Sort
View
ISHPC
2003
Springer
15 years 2 months ago
Chordal Topologies for Interconnection Networks
Abstract. The class of dense circulant graphs of degree four with optimal distance-related properties is analyzed in this paper. An algebraic study of this class is done. Two geome...
Ramón Beivide, Carmen Martínez, Cruz...
COMBINATORICS
2002
116views more  COMBINATORICS 2002»
14 years 9 months ago
Toida's Conjecture is True
Let S be a subset of the units in Zn. Let be a circulant graph of order n (a Cayley graph of Zn) such that if ij E(), then i - j (mod n) S. Toida conjectured that if is another...
Edward Dobson, Joy Morris
IPL
2002
71views more  IPL 2002»
14 years 9 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
PDP
2005
IEEE
15 years 3 months ago
Practicable Layouts for Optimal Circulant Graphs
Circulant graphs have been deeply studied in technical literature. Midimew networks are a class of distancerelated optimal circulant graphs of degree four which have applications ...
Enrique Vallejo, Ramón Beivide, Carmen Mart...
DM
2000
88views more  DM 2000»
14 years 9 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