Search Results for ""

A local source is a node of a directed graph with no entering edges (Borowski and Borwein 1991, p. 401; left figure), and a global source (often simply called a source) is a ...

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. ...

On a Riemannian manifold M, tangent vectors can be moved along a path by parallel transport, which preserves vector addition and scalar multiplication. So a closed loop at a ...

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 ...

In the early 1950s, Ernst Straus asked 1. Is every region illuminable from every point in the region? 2. Is every region illuminable from at least one point in the region? ...

The tractrix arises in the following problem posed to Leibniz: What is the path of an object starting off with a vertical offset when it is dragged along by a string of ...

A block is a maximal connected subgraph of a given graph G that has no articulation vertex (West 2000, p. 155). If a block has more than two vertices, then it is biconnected. ...

An edge-induced subgraph is a subset of the edges of a graph G together with any vertices that are their endpoints. The subgraph induced by a set of edges can be computed in ...

The Balaban index J is a graph index defined for a graph on n nodes, m edges, and c connected components by J=m/(gamma+1)sum_((i,j) in E(G))(D_iD_j)^(-1/2), where gamma=m-n+c ...

A vertex coloring is an assignment of labels or colors to each vertex of a graph such that no edge connects two identically colored vertices. The most common type of vertex ...