Search Results for ""

A vertex cut, also called a vertex cut set or separating set (West 2000, p. 148), of a connected graph G is a subset of the vertex set S subset= V(G) such that G-S has more ...

The degree of a graph vertex v of a graph G is the number of graph edges which touch v. The vertex degrees are illustrated above for a random graph. The vertex degree is also ...

The vertical line test is a graphical method of determining whether a curve in the plane represents the graph of a function by visually examining the number of intersections ...

Let s_i be the sum of the products of distinct polynomial roots r_j of the polynomial equation of degree n a_nx^n+a_(n-1)x^(n-1)+...+a_1x+a_0=0, (1) where the roots are taken ...

Four circles may be drawn through an arbitrary point P on a torus. The first two circles are obvious: one is in the plane of the torus and the second perpendicular to it. The ...

As defined by Gray (1997, p. 201), Viviani's curve, sometimes also called Viviani's window, is the space curve giving the intersection of the cylinder of radius a and center ...

Voronin (1975) proved the remarkable analytical property of the Riemann zeta function zeta(s) that, roughly speaking, any nonvanishing analytic function can be approximated ...

To find the motion of a rectangular membrane with sides of length L_x and L_y (in the absence of gravity), use the two-dimensional wave equation ...

The weak law of large numbers (cf. the strong law of large numbers) is a result in probability theory also known as Bernoulli's theorem. Let X_1, ..., X_n be a sequence of ...

The term "wedge" has a number of different meanings in mathematics. It is sometimes used as another name for the caret symbol. The term also refers to the notation ( ^ ) used ...