Search Results for ""

There are two distinct notions of connectivity in a directed graph. A directed graph is weakly connected if there is an undirected path between any pair of vertices, and ...

A connected set is a set that cannot be partitioned into two nonempty subsets which are open in the relative topology induced on the set. Equivalently, it is a set which ...

A space D is connected if any two points in D can be connected by a curve lying wholly within D. A space is 0-connected (a.k.a. pathwise-connected) if every map from a ...

The connected sum M_1#M_2 of n-manifolds M_1 and M_2 is formed by deleting the interiors of n-balls B_i^n in M_i^n and attaching the resulting punctured manifolds M_i-B^._i ...

A connection game is a board game in which players compete to develop or complete a type of topological connection with their pieces. This could involve forming a path ...

A function, or the symbol representing a function, which corresponds to English conjunctions such as "and," "or," "not," etc. that takes one or more truth values as input and ...

A constant function is function f(x)=c whose value does not change as its parameters vary. The function graph of a one-dimensional constant function is a straight line. The ...

Let a graph G=(V,E) be defined on vertex set V and edge set E. Then a construction sequence (or c-sequence) for G is a linear order on V union E in which each edge appears ...

A constructive proof is a proof that directly provides a specific example, or which gives an algorithm for producing an example. Constructive proofs are also called ...

Given a subset S subset R^n and a point x in S, the contingent cone K_S(x) at x with respect to S is defined to be the set K_S(x)={h:d_S^-(x;h)=0} where d_S^- is the upper ...