Search Results for ""

A definable set, also called a Souslin set.

The determination of the number of alternating permutations having elements {1,2,...,n}.

Shapes such as segments or angles appear larger when placed inside a larger angle.

1. A fixed polyomino. 2. The set of points obtained by taking the centers of a fixed polyomino.

An antimagic graph is a graph with e graph edges labeled with distinct elements {1,2,...,e} so that the sum of the graph edge labels at each graph vertex differ.

A set which transforms via converse functions. Antisets usually arise in the context of Chu spaces.

A relation R on a set S is antisymmetric provided that distinct elements are never both related to one another. In other words xRy and yRx together imply that x=y.

Araya and Wiener (2011) found the two cubic planar hypohamiltonian graphs on 70 and 88 vertices, respectively, illustrated above.

A directed graph is called an arborescence if, from a given node x known as the root vertex, there is exactly one elementary path from x to every other node y.

The arc set of a directed graph is the set of all arcs (directed edges) of the graph. The arc set for a directed graph g is given in the Wolfram Language by EdgeList[g].