Search Results for ""

The lower independence number i(G) of a graph G is the minimum size of a maximal independent vertex set in G. The lower indepedence number is equiavlent to the "independent ...

The (lower) irredundance number ir(G) of a graph G is the minimum size of a maximal irredundant set of vertices in G. The upper irredundance number is defined as the maximum ...

A graph is strongly perfect if every induced subgraph H has an independent vertex set meeting all maximal cliques of H (Berge and Duchet 1984, Ravindra 1999). Every strongly ...

The upper domination number Gamma(G) of a graph G is the maximum size of a minimal dominating set of vertices in G. The (lower) domination number may be similarly defined as ...

The upper irredundance number IR(G) of a graph G is the maximum size of an irredundant set of vertices in G. It is therefore equal to the size of a maximum irredundant set as ...

The term "amplitude" is used to refer to the magnitude of an oscillation, so the amplitude of the sinusoid y=Asin(omegat) is |A|, where |A| is the absolute value of A. The ...

The nonconservation of adiabatic invariants which arises in systems with three or more degrees of freedom.

The partial differential equation w_t-6(w+epsilon^2w^2)w_x+w_(xxx)=0, which can also be rewritten (w)_t+(-3w^2-2epsilon^2w^3+w_(xx))_x=0.

Let W(u) be a Wiener process. Then where V_t=f(W(t),tau) for 0<=tau=T-t<=T, and f in C^(2,1)((0,infty)×[0,T]). Note that while Ito's lemma was proved by Kiyoshi Ito (also ...

A curve similar to the sine function but possibly shifted in phase, period, amplitude, or any combination thereof. The general sinusoid of amplitude a, angular frequency ...