Search Results for ""

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

The Voronov-Neopryatnaya-Dergachev graphs are two graphs on 372 and 972 vertices which have unit-distance embeddings with all vertices on a sphere and chromatic number 5. The ...

Let X_1, ..., X_N be a sequence of independent observations of a random variable X, and let the number of observations N itself be chosen at random. Then Wald's equation ...

There are at least two theorems known as Weierstrass's theorem. The first states that the only hypercomplex number systems with commutative multiplication and addition are ...

A totally ordered set (A,<=) is said to be well ordered (or have a well-founded order) iff every nonempty subset of A has a least element (Ciesielski 1997, p. 38; Moore 1982, ...

The doublestruck capital letter Z, Z, denotes the ring of integers ..., -2, -1, 0, 1, 2, .... The symbol derives from the German word Zahl, meaning "number" (Dummit and Foote ...

There are a number of graphs associated with T. I. (and C. T.) Zamfirescu. The Zamfirescu graphs on 36 and 75 vertices, the former of which is a snark, appear in Zamfirescu ...

The identity element of an additive monoid or group or of any other algebraic structure (e.g., ring, module, abstract vector space, algebra) equipped with an addition. It is ...

A graph whose nodes are sequences of symbols from some alphabet and whose edges indicate the sequences which might overlap. The above figures show the first few n-dimensional ...