35 search results - page 3 / 7 » Neighbourhood Graphs of Cayley Graphs for Finitely-generated... |
COMBINATORICA
2000
13 years 5 months ago
2000
Given a connected graph, X, we denote by 2 = 2(X) its smallest non-zero Laplacian eigenvalue. In this paper we show that among all sets of n - 1 transpositions which generate the ...
IJAC
2008
13 years 6 months ago
2008
We give an efficient algorithm to randomly generate finitely generated subgroups of a given size, in a finite rank free group. Here, the size of a subgroup is the number of vertic...
COMBINATORICS
2002
13 years 5 months ago
2002
The lattice of noncrossing partitions can be embedded into the Cayley graph of the symmetric group. This allows us to rederive connections between noncrossing partitions and parki...
COMBINATORICS
1998
13 years 5 months ago
1998
Voltage graphs are a powerful tool for constructing large graphs (called lifts) with prescribed properties as covering spaces of small base graphs. This makes them suitable for ap...
JCT
2007
13 years 5 months ago
2007
