Search Results for ""

The deltoidal icositetrahedral graph is Archimedean dual graph which is the skeleton of the deltoidal icositetrahedron. It is implemented in the Wolfram Language as ...

The disdyakis dodecahedral graph is Archimedean dual graph which is the skeleton of the disdyakis dodecahedron. It is implemented in the Wolfram Language as ...

The disdyakis triacontahedral graph is Archimedean dual graph which is the skeleton of the disdyakis triacontahedron. It is implemented in the Wolfram Language as ...

The free module of rank n over a nonzero unit ring R, usually denoted R^n, is the set of all sequences {a_1,a_2,...,a_n} that can be formed by picking n (not necessarily ...

A path in a graph G is a subgraph of G that is a path graph (West 2000, p. 20). The length of a path is the number of edges it contains. In most contexts, a path must contain ...

A graphic sequence is a sequence of numbers which can be the degree sequence of some graph. A sequence can be checked to determine if it is graphic using GraphicQ[g] in the ...

The Hatzel graph is a planar hypohamiltonian graph on 57 vertices that was the smallest known example of such a graph until the discovery of the Zamfirescu graph on 48 ...

An idoneal number, also called a suitable number or convenient number, is a positive integer D for which the fact that a number is a monomorph (i.e., is expressible in only ...

The inverse hyperbolic secant sech^(-1)z (Beyer 1987, p. 181; Zwillinger 1995, p. 481), sometimes called the area hyperbolic secant (Harris and Stocker 1998, p. 271) and ...

The Jacobsthal numbers are the numbers obtained by the U_ns in the Lucas sequence with P=1 and Q=-2, corresponding to a=2 and b=-1. They and the Jacobsthal-Lucas numbers (the ...