207 search results - page 4 / 42 » Powers of cycles, powers of paths, and distance graphs |
77
Voted
CCCG
2008
14 years 11 months ago
2008
Let G be a graph embedded in the L1-plane. The stretch factor of G is the maximum over all pairs of distinct vertices p and q of G of the ratio LG 1 (p, q)/L1(p, q), where LG 1 (p...
COMBINATORICS
2007
14 years 9 months ago
2007
The known bijections on Dyck paths are either involutions or have notoriously intractable cycle structure. Here we present a size-preserving bijection on Dyck paths whose cycle st...
81
Voted
ALGORITHMICA
2006
14 years 9 months ago
2006
The k-Leaf Power recognition problem is a particular case of graph power problems: For a given graph it asks whether there exists an unrooted tree--the k-leaf root--with leaves on...
104
Voted
CORR
2008
Springer
14 years 9 months ago
2008
Springer
The underwater acoustic channel is characterized by a path loss that depends not only on the transmission distance, but also on the signal frequency. As a consequence, transmission...
118
Voted
COMBINATORICA
2011
13 years 9 months ago
2011
The topological Tverberg theorem states that for any prime power q and continuous map from a (d + 1)(q − 1)-simplex to Rd , there are q disjoint faces Fi of the simplex whose im...