Search Results for ""

A vertex-induced subgraph (sometimes simply called an "induced subgraph") is a subset of the vertices of a graph G together with any edges whose endpoints are both in this ...

The contraction of a pair of vertices v_i and v_j of a graph, also called vertex identification, is the operation that produces a graph in which the two nodes v_1 and v_2 are ...

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

The vertex figure at a vertex V of a polygon is the line segment joining the midpoints of the two adjacent sides meeting at V. For a regular n-gon with side length a, the ...

Every sufficiently large odd number is a sum of three primes (Vinogradov 1937). Ramachandra and Sankaranarayanan (1997) have shown that for sufficiently large n, the error ...

An integral equation of the form f(x)=int_a^xK(x,t)phi(t)dt, where K(x,t) is the integral kernel, f(x) is a specified function, and phi(t) is the function to be solved for.

An integral equation of the form phi(x)=f(x)+int_a^xK(x,t)phi(t)dt, where K(x,t) is the integral kernel, f(x) is a specified function, and phi(t) is the function to be solved ...

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

A number n is called wasteful if the number of digits in the prime factorization of n (including powers) uses more digits than the number of digits in n. The first few ...