Search Results for ""

A node in a graph for which the graph eccentricity equals the graph diameter (Harary 1994, p. 41).

An n-route is defined as a walk of length n with specified initial point in which no line succeeds itself.

A graph G is the edge graph of a polyhedron iff G is a simple planar graph which is 3-connected.

The set of all centroid points in a weighted tree (Harary 1994, p. 36).

A k-factor of a graph is a k-regular subgraph of order n. k-factors are a generalization of complete matchings. A perfect matching is a 1-factor (Skiena 1990, p. 244).

An object created by folding a piece of paper along certain lines to form loops. The number of states possible in an n-flexagon is a Catalan number. By manipulating the ...

A parallelogram polyomino is a polyomino such that the intersection with every line perpendicular to the main diagonal is a connected segment. The number of parallelogram ...

The chromatic invariant theta(G) of a connected graph G is the number of spanning trees of G that have internal activity 1 and external activity 0. For graphs other than the ...

A series is an infinite ordered set of terms combined together by the addition operator. The term "infinite series" is sometimes used to emphasize the fact that series ...

A portion of a disk whose upper boundary is a (circular) arc and whose lower boundary is a chord making a central angle theta<pi radians (180 degrees), illustrated above as ...