Search Results for ""
1311 - 1320 of 2823 for Unit_distance_graphSearch Results
In 1850, Bravais demonstrated that crystals were comprised of 14 different types of unit cells: simple cubic, body-centered cubic, face-centered cubic; simple tetragonal, ...
The hat is a caret-shaped symbol commonly placed on top of variables to give them special meaning. The symbol x^^ is voiced "x-hat" (or sometimes as "x-roof") in mathematics, ...
A fraction containing each of the digits 1 through 9 is called a pandigital fraction. The following table gives the number of pandigital fractions which represent simple unit ...
A ring homomorphism is a map f:R->S between two rings such that 1. Addition is preserved:f(r_1+r_2)=f(r_1)+f(r_2), 2. The zero element is mapped to zero: f(0_R)=0_S, and 3. ...
The nth roots of unity are roots e^(2piik/n) of the cyclotomic equation x^n=1, which are known as the de Moivre numbers. The notations zeta_k, epsilon_k, and epsilon_k, where ...
Given an ordinary differential equation y^'=f(x,y), the slope field for that differential equation is the vector field that takes a point (x,y) to a unit vector with slope ...
The 12-faced convex deltahedra also known as the Siamese dodecahedron, which is also Johnson solid J_(84). It is implemented in the Wolfram Language as ...
The Laplacian polynomial is the characteristic polynomial of the Laplacian matrix. The second smallest root of the Laplacian polynomial of a graph g (counting multiple values ...
An algorithm which can be used to find a good, but not necessarily minimal, edge or vertex coloring for a graph. However, the algorithm does minimally color complete ...
The Faulkner-Younger graphs (Faulkner and Younger 1974) are the cubic polyhedral nonhamiltonian graphs on 42 and 44 vertices illustrated above that are counterexamples to ...
...
View search results from all Wolfram sites (22301 matches)

