Search Results for ""

Let gamma(G) denote the domination number of a simple graph G. Then Vizing (1963) conjectured that gamma(G)gamma(H)<=gamma(G×H), where G×H is the graph product. While the ...

Vizing's theorem states that a graph can be edge-colored in either Delta or Delta+1 colors, where Delta is the maximum vertex degree of the graph. This partitions graphs into ...

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

A volume element is the differential element dV whose volume integral over some range in a given coordinate system gives the volume of a solid, V=intintint_(G)dxdydz. (1) In ...

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

The voter model is a simple mathematical model of opinion formation in which voters are located at the nodes of a network, each voter has an opinion (in the simplest case, 0 ...

A W^*-algebra is a C-*-algebra A for which there is a Banach space A_* such that its dual is A. Then the space A_* is uniquely defined and is called the pre-dual of A. Every ...

A basin of attraction in which every point on the common boundary of that basin and another basin is also a boundary of a third basin. In other words, no matter how closely a ...

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