Search Results for ""

The concept of irredundance was introduced by Cockayne et al. (1978). Let N_G[v] denote the graph neighborhood of a vertex v in a graph G (including v itself), and let N_G[S] ...

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

A Lyapunov function is a scalar function V(y) defined on a region D that is continuous, positive definite, V(y)>0 for all y!=0), and has continuous first-order partial ...

A maximal independent vertex set of a graph is an independent vertex set that cannot be expanded to another independent vertex set by addition of any vertex in the graph. A ...

A function is said to be modular (or "elliptic modular") if it satisfies: 1. f is meromorphic in the upper half-plane H, 2. f(Atau)=f(tau) for every matrix A in the modular ...

A pentomino is a 5-polyomino. There are 12 free pentominoes, 18 one-sided pentominoes, and 63 fixed pentominoes. The twelve free pentominoes are known by the letters of the ...

A point is a 0-dimensional mathematical object which can be specified in n-dimensional space using an n-tuple (x_1, x_2, ..., x_n) consisting of n coordinates. In dimensions ...

The polar sine is a function of a vertex angle of an n-dimensional parallelotope or simplex. If the content of the parallelotope is P and the lengths of the n edges of the ...

A polyhedron is said to be regular if its faces and vertex figures are regular (not necessarily convex) polygons (Coxeter 1973, p. 16). Using this definition, there are a ...

The scalar triple product of three vectors A, B, and C is denoted [A,B,C] and defined by [A,B,C] = A·(BxC) (1) = B·(CxA) (2) = C·(AxB) (3) = det(ABC) (4) = |A_1 A_2 A_3; B_1 ...