Search Results for ""

An untraceable graph is a graph that does not possess a Hamiltonian path, i.e., one that is not traceable. All disconnected graphs are therefore untraceable. Untraceable ...

A vector basis of a vector space V is defined as a subset v_1,...,v_n of vectors in V that are linearly independent and span V. Consequently, if (v_1,v_2,...,v_n) is a list ...

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 term "vesica piscis," meaning "fish bladder" in Latin, is used for the particular symmetric lens formed by the intersection of two equal circles whose centers are offset ...

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

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

The Weierstrass zeta function zeta(z;g_2,g_3) is the quasiperiodic function defined by (dzeta(z;g_2,g_3))/(dz)=-P(z;g_2,g_3), (1) where P(z;g_2,g_3) is the Weierstrass ...

A well-covered graph is a graph for which every minimal vertex cover has the same size, which is equivalent to every maximal independent vertex set being the same size. It is ...