Search Results for ""

The Desargues graph is the cubic symmetric graph on 20 vertices and 30 edges illustrated above in several embeddings. It is isomorphic to the generalized Petersen graph ...

The number of digits D in an integer n is the number of numbers in some base (usually 10) required to represent it. The numbers 1 to 9 are therefore single digits, while the ...

The Dyck graph is unique cubic symmetric graph on 32 nodes, illustrated above in a number of embeddings. It is denoted F_(032)A in the Foster census of cubic symmetric graphs ...

The Fourier transform is a generalization of the complex Fourier series in the limit as L->infty. Replace the discrete A_n with the continuous F(k)dk while letting n/L->k. ...

A generalized quadrangle is a generalized polygon of order 4. An order-(s,t) generalized quadrangle contains s+1 points in each line and has t+1 lines through every point, ...

The greatest common divisor, sometimes also called the highest common divisor (Hardy and Wright 1979, p. 20), of two positive integers a and b is the largest divisor common ...

The Hoffman-Singleton graph is the graph on 50 nodes and 175 edges that is the only regular graph of vertex degree 7, diameter 2, and girth 5. It is the unique (7,5)-cage ...

The icosahedral graph is the Platonic graph whose nodes have the connectivity of the regular icosahedron, as well as the great dodecahedron, great icosahedron Jessen's ...

An integral of the form intf(z)dz, (1) i.e., without upper and lower limits, also called an antiderivative. The first fundamental theorem of calculus allows definite ...

Inversion is the process of transforming points P to a corresponding set of points P^' known as their inverse points. Two points P and P^' are said to be inverses with ...