5 search results - page 1 / 1 » On Solvable Groups and Circulant Graphs |
EJC
2000
13 years 7 months ago
2000
COMBINATORICS
1998
13 years 7 months ago
1998
A circulant graph G of order n is a Cayley graph over the cyclic group Zn. Equivalently, G is circulant iff its vertices can be ordered such that the corresponding adjacency matr...
COMBINATORICS
2002
13 years 7 months ago
2002
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...
WDAG
2007
Springer
14 years 1 months ago
2007
Springer
A group of identical mobile agents moving asynchronously among the nodes of an anonymous network have to gather together in a single node of the graph. This problem known as the (a...
ECCC
2006
13 years 7 months ago
2006
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...