Search Results for ""

The (upper) vertex independence number of a graph, often called simply "the" independence number, is the cardinality of the largest independent vertex set, i.e., the size of ...

A proper subset S^' of a set S, denoted S^' subset S, is a subset that is strictly contained in S and so necessarily excludes at least one member of S. The empty set is ...

A cactus graph, sometimes also called a cactus tree, a mixed Husimi tree, or a polygonal cactus with bridges, is a connected graph in which any two graph cycles have no edge ...

Cantellation, also known as (polyhedron) expansion (Stott 1910, not to be confused with general geometric expansion) is the process of radially displacing the edges or faces ...

The Neuberg A_1-circle is the locus of the polygon vertex A_1 of a triangle on a given base A_2A_3 and with a given Brocard angle omega. From the center N_1, the base A_2A_3 ...

The traveling salesman problem is a problem in graph theory requiring the most efficient (i.e., least total distance) Hamiltonian cycle a salesman can take through each of n ...

One of the Zermelo-Fraenkel axioms which asserts the existence for any set a of a set x such that, for any y of a, if there exists a z satisfying A(y,z), then such z exists ...

A Julia set with c=-0.123+0.745i, also known as the dragon fractal.

A Cantor set with Lebesgue measure greater than 0.

Let (a)_i and (b)_i be sequences of complex numbers such that b_j!=b_k for j!=k, and let the lower triangular matrices F=(f)_(nk) and G=(g)_(nk) be defined as ...