Search Results for ""

A knot used to shorten a long rope.

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 ...

A method for constructing magic squares of odd order, also called de la Loubere's method.

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 nth-order Sierpiński carpet graph is the connectivity graph of black squares in the nth iteration of the Sierpiński carpet fractal. The first three iterations are shown ...

The nth-order Sierpiński tetrahedron graph is the connectivity graph of black triangles in the nth iteration of the tetrix fractal. The first three iterations are shown ...

The integral int_0^thetae^(-xsecphi)dphi.

The property intf(y)delta(x-y)dy=f(x) obeyed by the delta function delta(x).

A sigma-compact topological space is a topological space that is the union of countably many compact subsets.

A family composed of countably many discrete families.