Search Results for ""

The minimum spanning tree of a weighted graph is a set of edges of minimum total weight which form a spanning tree of the graph. When a graph is unweighted, any spanning tree ...

A path gamma is a continuous mapping gamma:[a,b]|->C^0, where gamma(a) is the initial point, gamma(b) is the final point, and C^0 denotes the space of continuous functions. ...

A pseudoforest is an undirected graph in which every connected component contains at most one graph cycle. A pseudotree is therefore a connected pseudoforest and a forest ...

The vertex cover number is the size of a minimum vertex cover in a graph G is known as the vertex cover number of G, denoted tau(G). The König-Egeváry theorem states that the ...

A walk is a sequence v_0, e_1, v_1, ..., v_k of graph vertices v_i and graph edges e_i such that for 1<=i<=k, the edge e_i has endpoints v_(i-1) and v_i (West 2000, p. 20). ...

An algebraic surface of order 3. Schläfli and Cayley classified the singular cubic surfaces. On the general cubic, there exists a curious geometrical structure called double ...

Two lines that lie on top of one another are called coincident lines.

A "line" having imaginary coefficients in its equations which can arise in algebraic geometry.

Two or more lines or line segments which are perpendicular are said to be orthogonal.

A transversal line is a line which intersects each of a given set of other lines. It is also called a semisecant.