Search Results for ""

A discontinuity is point at which a mathematical object is discontinuous. The left figure above illustrates a discontinuity in a one-variable function while the right figure ...

The Byzantine generals problem considers a computer with many programs running, some of them possibly unfriendly, and asks how the computer can function properly. More ...

The n-cycle complement graph C^__n is the graph complement of the cycle graph C_n. Cycle complement graphs are special cases of circulant graphs. The first few are ...

Let i_k(G) be the number of irredundant sets of size k in a graph G, then the irredundance polynomial R_G(x) of G in the variable x is defined as ...

The Hanoi graph H_n corresponding to the allowed moves in the tower of Hanoi problem. The above figure shows the Hanoi graphs for small n. The Hanoi graph H_n can be ...

The rhombicosahedral graph, illustrated above, is the skeleton of the icosidodecadodecahedron, rhombicosahedron and rhombidodecadodecahedron. It will be implemented in a ...

The n-Andrásfai graph is a circulant graph on 3n-1 nodes whose indices are given by the integers 1, ..., 3n-1 that are congruent to 1 (mod 3). The Andrásfai graphs have graph ...

The union G=G_1 union G_2 of graphs G_1 and G_2 with disjoint point sets V_1 and V_2 and edge sets X_1 and X_2 is the graph with V=V_1 union V_2 and X=X_1 union X_2 (Harary ...

An ordering for the Cartesian product × of any two sets A and B with order relations <A and <B, respectively, such that if (a_1,b_1) and (a_2,b_2) both belong to A×B, then ...

A string of length n on an alphabet l of m characters is an arrangement of n not necessarily distinct symbols from l. There are m^n such distinct strings. For example, the ...