Search Results for ""

Integral calculus is that portion of "the" calculus dealing with integrals. Among his many other talents, Major General Stanley in Gilbert and Sullivan's operetta The Pirates ...

The skeleton graphs of the Johnson solids are polyhedral graphs. The Johnson skeleton graphs J_3 and J_(63) are minimal unit-distance forbidden graphs. The skeleton of the ...

The Leonard graph is a distance-regular graph on 288 vertices (Brouwer et al. 1989, p. 369) with intersection array {12,11,10,7;1,2,5,12}. It is however not ...

The term "lobster" is used to refer either to a particular polyiamond or to a class of tree called a lobster graph. When referring to polyiamonds, the lobster is the ...

Long division is an algorithm for dividing two numbers, obtaining the quotient one digit at a time. The example above shows how the division of 123456/17 is performed to ...

The M_(22) graph, also known as the 77-graph, is a strongly regular graph on 77 nodes related to the Mathieu group M_(22) and to the Witt design. It is illustrated above in ...

The McLaughlin graph is a 112-regular graph on 275 nodes and 15400 edges that can be constructed from the Witt design. It is distance-regular with intersection array ...

A Meyniel graph, also called a very strongly perfect graph, is a graph in which every odd cycle of length five or more has at least two chords. Meyniel graphs are perfect. ...

In simple algebra, multiplication is the process of calculating the result when a number a is taken b times. The result of a multiplication is called the product of a and b, ...

A plot of the cells on a grid satisfying bitwise XOR(a,b)<n for consecutive values of n=1, 2, .... It is thought that it was discovered by Jackson Wright on the RLE PDP-1 ...