Search Results for ""

Vector addition is the operation of adding two or more vectors together into a vector sum. The so-called parallelogram law gives the rule for vector addition of two or more ...

A connected dominating set in a connected graph G is a dominating set in G whose vertices induce a connected subgraph, i.e., one in which there is no dominating vertex not ...

The most general form of "an" exponential function is a power-law function of the form f(x)=ab^(cx+d), (1) where a, c, and d are real numbers, b is a positive real number, ...

The size of a minimum edge cover in a graph G is known as the edge cover number of G, denoted rho(G). If a graph G has no isolated points, then nu(G)+rho(G)=|G|, where nu(G) ...

Specifying two angles A and B and a side a opposite A uniquely determines a triangle with area K = (a^2sinBsinC)/(2sinA) (1) = (a^2sinBsin(pi-A-B))/(2sinA). (2) The third ...

Exponential decay is the decrease in a quantity N according to the law N(t)=N_0e^(-lambdat) (1) for a parameter t and constant lambda (known as the decay constant), where e^x ...

A group or other algebraic object is called non-Abelian if the law of commutativity does not always hold, i.e., if the object is not Abelian. For example, the group of ...

Specifying three sides uniquely determines a triangle whose area is given by Heron's formula, K=sqrt(s(s-a)(s-b)(s-c)), (1) where s=1/2(a+b+c) (2) is the semiperimeter of the ...

The gonality (also called divisorial gonality) gon(G) of a (finite) graph G is the minimum degree of a rank 1 divisor on that graph. It can be thought of as the minimum ...

A cylinder can be dissected into unequal squares, with nine squares required at a minimum. Trivial squarings can be constructed by taking rectangle dissections and matching ...