Search Results for ""

A perfect graph is a graph G such that for every induced subgraph of G, the clique number equals the chromatic number, i.e., omega(G)=chi(G). A graph that is not a perfect ...

A curve of constant width constructed by drawing arcs from each polygon vertex of an equilateral triangle between the other two vertices. The Reuleaux triangle has the ...

A surface of revolution is a surface generated by rotating a two-dimensional curve about an axis. The resulting surface therefore always has azimuthal symmetry. Examples of ...

Tutte's (46-vertex) graph is a cubic nonhamiltonian graph contructed by Tutte (1946) as a counterexample to Tait's Hamiltonian graph conjecture by using three copies ...

The cube is the Platonic solid composed of six square faces that meet each other at right angles and has eight vertices and 12 edges. It is also the uniform polyhedron with ...

The triangle with edge lengths 3, 4, and 5 is the right triangle with smallest possible integer lengths and corresponds to the Pythagorean triple (3,4,5) where the legs have ...

Aleph-1 is the set theory symbol aleph_1 for the smallest infinite set larger than aleph_0 (Aleph-0), which in turn is equal to the cardinal number of the set of countable ...

A topological two-sphere in three-space whose exterior is not simply connected. The outer complement of Antoine's horned sphere is not simply connected. Furthermore, the ...

Arc length is defined as the length along a curve, s=int_gamma|dl|, (1) where dl is a differential displacement vector along a curve gamma. For example, for a circle of ...

An Argand diagram is a plot of complex numbers as points z=x+iy in the complex plane using the x-axis as the real axis and y-axis as the imaginary axis. In the plot above, ...