33 search results - page 3 / 7 » Self-complementary circulant graphs |
50
Voted
ISAAC
2004
Springer
15 years 2 months ago
2004
Springer
43
Voted
CMA
2010
14 years 7 months ago
2010
CMA
2011
14 years 1 months ago
2011
67
Voted
PDCAT
2007
Springer
15 years 3 months ago
2007
Springer
A circulant graph with n nodes and jumps j1, j2, ..., jm is a graph in which each node i, 0 ≤ i ≤ n−1, is adjacent to all the vertices i±jk mod n, where 1 ≤ k ≤ m. A bi...
60
Voted
DM
2006
14 years 9 months ago
2006
Let 1 s1 < s2 <