Search Results for ""

A tree to whose nodes and/or edges labels (usually number) are assigned. The word "weight" also has a more specific meaning when applied to trees, namely the weight of a tree ...

An articulation vertex of a connected graph, also called a cut-vertex (Harary 1994, p. 26; West 2000; Gross and Yellen 2006) or "cutpoint" (Harary 1994, p. 26), is a vertex ...

Partial evaluation is a branch of computer science studying program transformation via specialization. Any function can be specialized by fixing one or more of its inputs to ...

The vertex connectivity kappa(G) of a graph G, also called "point connectivity" or simply "connectivity," is the minimum size of a vertex cut, i.e., a vertex subset S subset= ...

The edge connectivity, also called the line connectivity, of a graph is the minimum number of edges lambda(G) whose deletion from a graph G disconnects G. In other words, it ...

The mathematical study of knots. Knot theory considers questions such as the following: 1. Given a tangled loop of string, is it really knotted or can it, with enough ...

The spherical distance between two points P and Q on a sphere is the distance of the shortest path along the surface of the sphere (paths that cut through the interior of the ...

A sliver of the surface of a sphere of radius r cut out by two planes through the azimuthal axis with dihedral angle theta. The surface area of the lune is S=2r^2theta, which ...

In general, "a" calculus is an abstract theory developed in a purely formal way. "The" calculus, more properly called analysis (or real analysis or, in older literature, ...

A branch of mathematics that is a sort of generalization of calculus. Calculus of variations seeks to find the path, curve, surface, etc., for which a given function has a ...