Search Results for ""

A matrix, also called a canonical box matrix, having zeros everywhere except along the diagonal and superdiagonal, with each element of the diagonal consisting of a single ...

The Jørgensen graph is a maximally linklessly embeddable graph on 8 vertices and 21 edges, where "maximal" means it is not a proper subgraph of another linklessly embeddable ...

Find the minimum number f(n) of subsets in a separating family for a set of n elements, where a separating family is a set of subsets in which each pair of adjacent elements ...

The problem of determining how many nonattacking kings can be placed on an n×n chessboard. For n=8, the solution is 16, as illustrated above (Madachy 1979). In general, the ...

A path composed of connected horizontal and vertical line segments, each passing between adjacent lattice points. A lattice path is therefore a sequence of points P_0, P_1, ...

There are several conflicting meanings associated with the notation lgx. In German and Russian literature, the notation lgx is used to mean the common logarithm log_(10)x. ...

A minimal surface that contains lemniscates as geodesics which is given by the parametric equations x = R[sqrt(2)cos(1/3zeta)sqrt(cos(2/3zeta))] (1) y = ...

A number of points on a line segment. The term was first used by Desargues (Cremona 1960, p. x). If the points A, B, C, ... lie on a line segment with the coordinates of the ...

The Ljubljana graph is a graph on 112 vertices that is the third smallest cubic semisymmetric graph. It was discovered by Brouwer et al. (1993) and rediscovered by Conder et ...

A lobster graph, lobster tree, or simply "lobster," is a tree having the property that the removal of leaf nodes leaves a caterpillar graph (Gallian 2007). The numbers of ...