Search Results for ""

The term "continuum" has (at least) two distinct technical meanings in mathematics. The first is a compact connected metric space (Kuratowski 1968; Lewis 1983, pp. 361-394; ...

A topological space that is not connected, i.e., which can be decomposed as the disjoint union of two nonempty open subsets. Equivalently, it can be characterized as a space ...

The exponential transform is the transformation of a sequence a_1, a_2, ... into a sequence b_1, b_2, ... according to the equation ...

The radius of an excircle. Let a triangle have exradius r_A (sometimes denoted rho_A), opposite side of length a and angle A, area Delta, and semiperimeter s. Then r_1 = ...

The Georges graph, illustrated above, is 50-node graph which is the smallest currently known example of a 3-connected bicubic nonhamiltonian graph. It is implemented in the ...

The eccentricity epsilon(v) of a graph vertex v in a connected graph G is the maximum graph distance between v and any other vertex u of G. For a disconnected graph, all ...

The harmonic conjugate to a given function u(x,y) is a function v(x,y) such that f(x,y)=u(x,y)+iv(x,y) is complex differentiable (i.e., satisfies the Cauchy-Riemann ...

Let L be a lattice (or a bounded lattice or a complemented lattice, etc.), and let C_L be the covering relation of L: C_L={(x,y) in L^2|x covers y or y covers x}. Then C_L is ...

A maximally nonhamiltonian graph is a nonhamiltonian graph G for which G+e is Hamiltonian for each edge e in the graph complement of G^_, i.e., every two nonadjacent vertices ...

Let G be a graph with A and B two disjoint n-tuples of graph vertices. Then either G contains n pairwise disjoint AB-paths, each connecting a point of A and a point of B, or ...