Search Results for ""

The low-level language of topology, which is not really considered a separate "branch" of topology. Point-set topology, also called set-theoretic topology or general ...

A snake is an Eulerian path in the d-hypercube that has no chords (i.e., any hypercube edge joining snake vertices is a snake edge). Klee (1970) asked for the maximum length ...

Koh et al. (1980) and Gallian (2007) define a web graph as a stacked prism graph Y_(n+1,3) with the edges of the outer cycle removed. Web graphs are graceful. Precomputed ...

A two-dimensional grid graph, also known as a rectangular grid graph or two-dimensional lattice graph (e.g., Acharya and Gill 1981), is an m×n lattice graph that is the graph ...

A web diagram, also called a cobweb plot, is a graph that can be used to visualize successive iterations of a function y=f(x). In particular, the segments of the diagram ...

A caterpillar graph, caterpillar tree, or simply "caterpillar," is a tree in which every graph vertex is on a central stalk or only one graph edge away from the stalk (in ...

The path traced out by a point P on the edge of a circle of radius b rolling on the outside of a circle of radius a. An epicycloid is therefore an epitrochoid with h=b. ...

A geodesic is a locally length-minimizing curve. Equivalently, it is a path that a particle which is not accelerating would follow. In the plane, the geodesics are straight ...

A lossless data compression algorithm which uses a small number of bits to encode common characters. Huffman coding approximates the probability for each character as a power ...

The Icosian game, also called the Hamiltonian game (Ball and Coxeter 1987, p. 262), is the problem of finding a Hamiltonian cycle along the edges of an dodecahedron, i.e., a ...