Search Results for ""

A minimum edge cover is an edge cover having the smallest possible number of edges for a given graph. The size of a minimum edge cover of a graph is known as the edge cover ...

A minimum edge cut of a graph is an edge cut of smallest possible size. The size of a minimum edge cut in a connected graph G is called the graph's edge connectivity ...

A minimum vertex cut of a graph is a vertex cut of smallest possible size. A vertex cut set of size 1 in a connected graph corresponds to an articulation vertex. The size of ...

In many cases, the Hausdorff dimension correctly describes the correction term for a resonator with fractal perimeter in Lorentz's conjecture. However, in general, the proper ...

There are four fixed points (mod 1) of Minkowski's question mark function ?(x), namely x=0, 1/2, f and 1-f, where f<1/2 is a constant known as the Minkowski-Bower constant ...

If p>1, then Minkowski's integral inequality states that Similarly, if p>1 and a_k, b_k>0, then Minkowski's sum inequality states that [sum_(k=1)^n|a_k+b_k|^p]^(1/p) ...

A minor M_(ij) is the reduced determinant of a determinant expansion that is formed by omitting the ith row and jth column of a matrix A. So, for example, the minor M_(22) of ...

Three guests decide to stay the night at a lodge whose rate they are initially told is $30 per night. However, after the guests have each paid $10 and gone to their room, the ...

Polynomials M_k(x) which form the associated Sheffer sequence for f(t)=(e^t-1)/(e^t+1) (1) and have the generating function sum_(k=0)^infty(M_k(x))/(k!)t^k=((1+t)/(1-t))^x. ...

Let any finite or infinite set of points having no finite limit point be prescribed and associate with each of its points a principal part, i.e., a rational function of the ...