Search Results for ""

The hexagram is the star polygon {6/2}, also known as the star of David or Solomon's seal, illustrated at left above. It appears as one of the clues in the novel The Da Vinci ...

The lattice method is an alternative to long multiplication for numbers. In this approach, a lattice is first constructed, sized to fit the numbers being multiplied. If we ...

The maximum leaf number l(G) of a graph G is the largest number of tree leaves in any of its spanning trees. (The corresponding smallest number of leaves is known as the ...

A topology that is "potentially" a metric topology, in the sense that one can define a suitable metric that induces it. The word "potentially" here means that although the ...

The network flow problem considers a graph G with a set of sources S and sinks T and for which each edge has an assigned capacity (weight), and then asks to find the maximum ...

The tetragonal antiwedge is the topological class of hexahedron. It has 10 edges and 6 vertices and its faces consist of 4 triangles and 2 quadrilaterals. A tetragonal ...

In 1704, Sebastien Truchet considered all possible patterns formed by tilings of right triangles oriented at the four corners of a square (Wolfram 2002, p. 875). Truchet's ...

A well-covered graph is a graph for which every minimal vertex cover has the same size, which is equivalent to every maximal independent vertex set being the same size. It is ...

A graceful labeling (or graceful numbering) is a special graph labeling of a graph on m edges in which the nodes are labeled with a subset of distinct nonnegative integers ...

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