Search Results for ""

The Foster cage is one of the four (5,5)-cage graphs. Like the other (5,5)-cages, the Foster cage has 30 nodes. It has 75 edges, diameter 3, girth 5, chromatic number 4, and ...

Graham's biggest little hexagon is the largest possible (not necessarily regular) convex hexagon with polygon diameter 1 (i.e., for which no two of the vertices are more than ...

A path in a graph G is a subgraph of G that is a path graph (West 2000, p. 20). The length of a path is the number of edges it contains. In most contexts, a path must contain ...

In celestial mechanics, the fixed path a planet traces as it moves around the sun is called an orbit. When a group G acts on a set X (this process is called a group action), ...

A Halin graph, sometimes known as a roofless polyhedron, is a polyhedral graph constructed from a planar embedding of a tree having four or more vertices, no vertices of ...

A linear recurrence equation is a recurrence equation on a sequence of numbers {x_n} expressing x_n as a first-degree polynomial in x_k with k<n. For example ...

Approximants derived by expanding a function as a ratio of two power series and determining both the numerator and denominator coefficients. Padé approximations are usually ...

pi may be computed using a number of iterative algorithms. The best known such algorithms are the Archimedes algorithm, which was derived by Pfaff in 1800, and the ...

In the plane, the reflection property can be stated as three theorems (Ogilvy 1990, pp. 73-77): 1. The locus of the center of a variable circle, tangent to a fixed circle and ...

For a real positive t, the Riemann-Siegel Z function is defined by Z(t)=e^(itheta(t))zeta(1/2+it). (1) This function is sometimes also called the Hardy function or Hardy ...