Search Results for ""

The net graph is the graph on 6 vertices illustrated above. It is implemented in the Wolfram Language as GraphData["NetGraph"]. The bipartite double graph of the net graph is ...

Dickson states "In a letter to Tanner [L'intermediaire des math., 2, 1895, 317] Lucas stated that Mersenne (1644, 1647) implied that a necessary and sufficient condition that ...

A nonhamiltonian graph is a graph that is not Hamiltonian. All disconnected graphs are therefore nonhamiltoinian, as are acylic graphs. Classes of connected graphs that are ...

A nonplanar graph is a graph that is not planar. The numbers of simple nonplanar graphs on n=1, 2, ... nodes are 0, 0, 0, 0, 1, 14, 222, 5380, 194815, ... (OEIS A145269), ...

An ordered factorization is a factorization (not necessarily into prime factors) in which a×b is considered distinct from b×a. The following table lists the ordered ...

The word quadrature has (at least) three incompatible meanings. Integration by quadrature either means solving an integral analytically (i.e., symbolically in terms of known ...

The rising factorial x^((n)), sometimes also denoted <x>_n (Comtet 1974, p. 6) or x^(n^_) (Graham et al. 1994, p. 48), is defined by x^((n))=x(x+1)...(x+n-1). (1) This ...

The Roman surface, also called the Steiner surface (not to be confused with the class of Steiner surfaces of which the Roman surface is a particular case), is a quartic ...

Somos's quadratic recurrence constant is defined via the sequence g_n=ng_(n-1)^2 (1) with g_0=1. This has closed-form solution ...

"Spikey" is the logo of Wolfram Research, makers of Mathematica and the Wolfram Language. In its original (Version 1) form, it is an augmented icosahedron with an ...