35 search results - page 4 / 7 » Neighbourhood Graphs of Cayley Graphs for Finitely-generated... |
APAL
2005
13 years 7 months ago
2005
Abstract. We prove that a finitely generated group is context-free whenever its Cayleygraph has a decidable monadic second-order theory. Hence, by the seminal work of Muller and Sc...
JCT
2006
13 years 7 months ago
2006
We give two short proofs that for fixed d, a d-regular Cayley graph on an Abelian group of order n has second eigenvalue bounded below by d - O(dn-4/d), where the implied constant...
CORR
2002
Springer
13 years 7 months ago
2002
Springer
We give a precise definition of "generic-case complexity" and show that for a very large class of finitely generated groups the classical decision problems of group theor...
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...
EJC
2007
13 years 7 months ago
2007
We investigate the historical roots of the field of combinatorics on words. They comprise applications and interpretations in algebra, geometry and combinatorial enumeration. The...