Search Results for ""

One of the disjoint subsets making up a set partition. A block containing n elements is called an n-block. The partitioning of sets into blocks can be denoted using a ...

The definition of a set by enumerating its members. An extensional definition can always be reduced to an intentional one. An extension field is sometimes also called simply ...

For a set S, the span is defined by maxS-minS, where max is the maximum and min is the minimum.

A sorting method proposed by Shell (1959) in which records being sorted can take long jumps instead of being restricted to short steps.

A shortest path between two vertices of a graph is a graph path of shortest possible length between them. Such paths are also known as graph geodesics, and the matrix giving ...

Let v(G) be the number of vertices in a graph G and h(G) the length of the maximum cycle in G. Then the shortness exponent of a class of graphs G is defined by sigma(G)=lim ...

A shuffle-exchange graph is a nonsimple graph (due to the existence of graph loops) whose vertices are length n binary strings with an edge from w to w^' if 1. w^' differs ...

Two nodes connected to the same node which are same distance from the root vertex in a rooted tree are called siblings. A function to return the siblings of a vertex v in a ...

The 6-polyiamond illustrated above.

Interest which is paid only on the principal and not on the additional amount generated by previous interest payments. A formula for computing simple interest is ...