Search Results for ""

The vertex count of a graph g, commonly denoted V(g) or |g|, is the number of vertices in g. In other words, it is the cardinality of the vertex set. The vertex count of a ...

The depth of a vertex v in a rooted tree as the number of edges from v to the root vertex. A function to return the depth of a vertex v in a tree g may be implemented in a ...

The vertex height of a vertex v in a rooted tree is the number of edges on the longest downward path between v and a tree leaf. The height of the root vertex of a rooted tree ...

The number of graph edges meeting at a given node in a graph is called the order of that graph vertex.

If K is a simplicial complex, let V be the vertex set of K. Furthermore, let K be the collection of all subsets {a_0,...,a_n} of V such that the vertices a_0, ..., a_n span a ...

The horizontal line segment in the above figure appears to be shorter than the vertical line segment, despite the fact that it has the same length.

The system of partial differential equations (partial_t+partial_z^3+partial_(z^_)^3)v+partial_z(uv)+partial_(z^_)(vw) (1) partial_(z^_)u=3partial_zv (2) ...

Solution of a system of second-order homogeneous ordinary differential equations with constant coefficients of the form (d^2x)/(dt^2)+bx=0, where b is a positive definite ...

An auction in which the highest bidder wins but pays only the second-highest bid. This variation over the normal bidding procedure is supposed to encourage bidders to bid the ...

The substitution of x=w-p/(3w) (1) into the standard form cubic equation x^3+px=q. (2) The result reduces the cubic to the equation w^3-(p^3)/(27w^3)-q=0, (3) which is easily ...