Search Results for ""

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 ...

Given a unit disk, find the smallest radius r(n) required for n equal disks to completely cover the unit disk. The first few such values are r(1) = 1 (1) r(2) = 1 (2) r(3) = ...

Given a planar graph G, a geometric dual graph and combinatorial dual graph can be defined. Whitney showed that these are equivalent (Harary 1994), so that one may speak of ...

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 ...

In mathematics, a knot is defined as a closed, non-self-intersecting curve that is embedded in three dimensions and cannot be untangled to produce a simple loop (i.e., the ...

The Laplacian matrix, sometimes also called the admittance matrix (Cvetković et al. 1998, Babić et al. 2002) or Kirchhoff matrix, of a graph G, where G=(V,E) is an ...

The process of finding a reduced set of basis vectors for a given lattice having certain special properties. Lattice reduction algorithms are used in a number of modern ...

An algorithm which can be used to find integer relations between real numbers x_1, ..., x_n such that a_1x_1+a_2x_2+...+a_nx_n=0, with not all a_i=0. Although the algorithm ...

The pentagonal hexecontahedral graph is the Archimedean dual graph which is the skeleton of the pentagonal hexecontahedron. It is implemented in the Wolfram Language as ...