Search Results for ""

An integral graph, not to be confused with an integral embedding of a graph, is defined as a graph whose graph spectrum consists entirely of integers. The notion was first ...

An interior point method is a linear or nonlinear programming method (Forsgren et al. 2002) that achieves optimization by going through the middle of the solid defined by the ...

An interpretation of first-order logic consists of a non-empty domain D and mappings for function and predicate symbols. Every n-place function symbol is mapped to a function ...

An interval is a connected portion of the real line. If the endpoints a and b are finite and are included, the interval is called closed and is denoted [a,b]. If the ...

A graph G=(V,E) is an interval graph if it captures the intersection relation for some set of intervals on the real line. Formally, P is an interval graph provided that one ...

Given a circle C with center O and radius k, then two points P and Q are inverse with respect to C if OP·OQ=k^2. If P describes a curve C_1, then Q describes a curve C_2 ...

Points, also called polar reciprocals, which are transformed into each other through inversion about a given inversion circle C (or inversion sphere). The points P and P^' ...

If two points A and A^' are inverse with respect to a circle (the inversion circle), then the straight line through A^' which is perpendicular to the line of the points AA^' ...

A polynomial is said to be irreducible if it cannot be factored into nontrivial polynomials over the same field. For example, in the field of rational polynomials Q[x] (i.e., ...

Let G_1, G_2, ..., G_t be a t-graph edge coloring of the complete graph K_n, where for each i=1, 2, ..., t, G_i is the spanning subgraph of K_n consisting of all graph edges ...