Search Results for ""

A binary relation associated with an instance of the stable marriage problem. Stable marriages correspond to vertices with outdegree 0 in the divorce digraph (Skiena 1990, p. ...

An unlabeled transitive digraph with n nodes is called a "topology." The numbers of distinct topologies on n=1, 2, ... nodes are 1, 3, 9, 33, 139, 718, 4535, ... (OEIS ...

An acyclic digraph is a directed graph containing no directed cycles, also known as a directed acyclic graph or a "DAG." Every finite acyclic digraph has at least one node of ...

Complete digraphs are digraphs in which every pair of nodes is connected by a bidirectional edge.

An infinite sequence {a_i} of positive integers is called weakly independent if any relation sumepsilon_ia_i with epsilon_i=0 or +/-1 and epsilon_i=0, except finitely often, ...

The notion of weak amenability was first introduced by Bade et al. (1987), who termed a commutative Banach algebra A "weakly amenable" if every continuous derivation from A ...

A local sink is a node of a directed graph with no exiting edges, also called a terminal (Borowski and Borwein 1991, p. 401; left figure). A global sink (often simply called ...

A prime number is said to be weakly prime if changing a single digit to every other possible digit produces a composite number when performed on each digit. The first few ...

A topological space decomposes into its connected components. The connectedness relation between two pairs of points satisfies transitivity, i.e., if a∼b and b∼c then a∼c. ...

A graph in which each graph edge is replaced by a directed graph edge, also called a digraph. A directed graph having no multiple edges or loops (corresponding to a binary ...