Search Results for ""

A second-order linear Hermitian operator is an operator L^~ that satisfies int_a^bv^_L^~udx=int_a^buL^~v^_dx. (1) where z^_ denotes a complex conjugate. As shown in ...

"The" I graph is the path graph on two vertices: P_2. An I-graph I(n,j,k) for 1<=j,k<n and j,k!=n/2 is a generalization of a generalized Petersen graph and has vertex set ...

The radius of a polygon's incircle or of a polyhedron's insphere, denoted r or sometimes rho (Johnson 1929). A polygon possessing an incircle is same to be inscriptable or ...

A regularly spaced array of points in a square array, i.e., points with coordinates (m,n,...), where m, n, ... are integers. Such an array is often called a grid or mesh, and ...

An invertible knot is a knot that can be deformed via an ambient isotopy into itself but with the orientation reversed. A knot that is not invertible is said to be ...

The Kittell graph is a planar graph on 23 nodes and 63 edges that tangles the Kempe chains in Kempe's algorithm and thus provides an example of how Kempe's supposed proof of ...

A k×n Latin rectangle is a k×n matrix with elements a_(ij) in {1,2,...,n} such that entries in each row and column are distinct. If k=n, the special case of a Latin square ...

The longhorn graph is the graph on 7 vertices illustrated above. It is implemented in the Wolfram Language as GraphData["LonghornGraph"].

The quantities obtained from cubic, hexagonal, etc., lattice sums, evaluated at s=1, are called Madelung constants. For cubic lattice sums ...

An edge-magic graph is a labeled graph with e graph edges labeled with distinct elements {1,2,...,e} so that the sum of the graph edge labels at each graph vertex is the ...