Search Results for ""
521 - 530 of 914 for Perfect magic cubeSearch Results
Checkers is a two-player game with the most common variant played on an 8×8 checkerboard with each player starts with twelve pieces of a fixed color on opposite sites of the ...
The chromatic number of a graph G is the smallest number of colors needed to color the vertices of G so that no two adjacent vertices share the same color (Skiena 1990, p. ...
A Heronian triangle is a triangle having rational side lengths and rational area. The triangles are so named because such triangles are related to Heron's formula ...
Knuth (2008, p. 44) terms the 24-vertex graph based on the notes of the musical scale illustrated above the "musical graph." This graph can be seen to be the 24-vertex case ...
A number x in which the first n decimal digits of the fractional part frac(x) sum to 666 is known as an evil number (Pegg and Lomont 2004). However, the term "evil" is also ...
The Kirchhoff sum index KfS is a graph index defined for a graph on n nodes by KfS=1/2sum_(i=1)^nsum_(j=1)^n((Omega)_(ij))/((d)_(ij)), where (Omega)_(ij) is the resistance ...
A general prism is a polyhedron possessing two congruent polygonal faces and with all remaining faces parallelograms (Kern and Bland 1948, p. 28; left figure). A right prism ...
The stability index Z^_(G) of a graph G is defined by Z^_=sum_(k=0)^(|_n/2_|)|c_(2k)|, where c_k is the kth coefficient of the characteristic polynomial and |_n_| denotes the ...
The tribonacci numbers are a generalization of the Fibonacci numbers defined by T_1=1, T_2=1, T_3=2, and the recurrence equation T_n=T_(n-1)+T_(n-2)+T_(n-3) (1) for n>=4 ...
The antenna graph is the graph on 6 vertices illustrated above. It is implemented in the Wolfram Language as GraphData["AntennaGraph"].
...
View search results from all Wolfram sites (4688 matches)

