Search Results for ""

The vertex connectivity kappa(G) of a graph G, also called "point connectivity" or simply "connectivity," is the minimum size of a vertex cut, i.e., a vertex subset S subset= ...

A weakly connected digraph is a directed graph in which it is possible to reach any node starting from any other node by traversing edges in some direction (i.e., not ...

The first and second Zagreb indices for a graph with vertex count n and vertex degrees v_i for i=1, ..., n are defined by Z_1=sum_(i=1)^nv_i^2 and Z_2=sum_((i,j) in ...

A Sheffer sequence for (1,f(t)) is called the associated sequence for f(t), and a sequence s_n(x) of polynomials satisfying the orthogonality conditions ...

The average power of a complex signal f(t) as a function of time t is defined as <f^2(t)>=lim_(T->infty)1/(2T)int_(-T)^T|f(t)|^2dt, where |z| is the complex modulus (Papoulis ...

A curve in two dimensions on which the value of a function f(x,y) is a constant. Other synonymous terms are equipotential curve, isarithm, and isopleth. A plot of several ...

An equilibrium point in game theory is a set of strategies {x^^_1,...,x^^_n} such that the ith payoff function K_i(x) is larger or equal for any other ith strategy, i.e., ...

A curve in two dimensions on which the value of a function f(x,y) is a constant. Other synonymous terms are isarithm, isopleth, and contour line. A plot of several ...

The intersection Ev of the Gergonne line and the Euler line. It has triangle center function alpha=(b(a-b+c)cosB+c(a+b-c)cosC-2a^2cosA)/(2a) and is Kimberling center X_(1375).

A set function mu is finitely additive if, given any finite disjoint collection of sets {E_k}_(k=1)^n on which mu is defined, mu( union _(k=1)^nE_k)=sum_(k=1)^nmu(E_k).