Search Results for ""

A point lattice is a regularly spaced array of points. In the plane, point lattices can be constructed having unit cells in the shape of a square, rectangle, hexagon, etc. ...

A regular graph that is edge-transitive but not vertex-transitive is called a semisymmetric graph (Marušič and Potočnik 2001). In contrast, any graph that is both ...

Given a reference triangle DeltaABC, the trilinear coordinates of a point P with respect to DeltaABC are an ordered triple of numbers, each of which is proportional to the ...

The Wigner 6j-symbols (Messiah 1962, p. 1062), commonly simply called the 6j-symbols, are a generalization of Clebsch-Gordan coefficients and Wigner 3j-symbol that arise in ...

A graceful graph is a graph that can be gracefully labeled. Special cases of graceful graphs include the utility graph K_(2,3) (Gardner 1983) and Petersen graph. A graph that ...

A matchstick graph is a simple graph which has a graph embedding that is planar, for which all distances between vertices have unit distance, and which is non-degenerate (so ...

A polyomino is a generalization of the domino to a collection of n squares of equal size arranged with coincident sides. Polyominos were originally called "super-dominoes" by ...

The term limit comes about relative to a number of topics from several different branches of mathematics. A sequence x_1,x_2,... of elements in a topological space X is said ...

An algebraic curve over a field K is an equation f(X,Y)=0, where f(X,Y) is a polynomial in X and Y with coefficients in K. A nonsingular algebraic curve is an algebraic curve ...

The antenna graph is the graph on 6 vertices illustrated above. It is implemented in the Wolfram Language as GraphData["AntennaGraph"].