Search Results for ""
2391 - 2400 of 2959 for Crystallographic Point GroupsSearch Results
The 24-cell is a finite regular four-dimensional polytope with Schläfli symbol {3,4,3}. It is also known as the hyperdiamond or icositetrachoron, and is composed of 24 ...
The m-book graph is defined as the graph Cartesian product B_m=S_(m+1) square P_2, where S_m is a star graph and P_2 is the path graph on two nodes. The generalization of the ...
There are three types of cubic lattices corresponding to three types of cubic close packing, as summarized in the following table. Now that the Kepler conjecture has been ...
An error-correcting code is an algorithm for expressing a sequence of numbers such that any errors which are introduced can be detected and corrected (within certain ...
The generalized Petersen graph GP(n,k), also denoted P(n,k) (Biggs 1993, p. 119; Pemmaraju and Skiena 2003, p. 215), for n>=3 and 1<=k<=|_(n-1)/2_| is a connected cubic graph ...
A graph embedding, sometimes also called a graph drawing, is a particular drawing of a graph. Graph embeddings are most commonly drawn in the plane, but may also be ...
The Greenfield graph is the name given in this work to the 12-vertex graph illustrated above due to Greenfield (2011). This graph provided the first known example which ...
The series sum_(k=1)^infty1/k (1) is called the harmonic series. It can be shown to diverge using the integral test by comparison with the function 1/x. The divergence, ...
A hyperbolic knot is a knot that has a complement that can be given a metric of constant curvature -1. All hyperbolic knots are prime knots (Hoste et al. 1998). A prime knot ...
The number of equivalent hyperspheres in n dimensions which can touch an equivalent hypersphere without any intersections, also sometimes called the Newton number, contact ...
...
View search results from all Wolfram sites (31034 matches)

