Search Results for ""

The Petersen family of graphs, not to be confused with generalized Petersen graphs, are a set of seven graphs obtained from the Petersen graph (or complete graph K_6) by del ...

The rank polynomial R(x,y) of a general graph G is the function defined by R(x,y)=sum_(S subset= E(G))x^(r(S))y^(s(S)), (1) where the sum is taken over all subgraphs (i.e., ...

Let a number n be written in binary as n=(epsilon_kepsilon_(k-1)...epsilon_1epsilon_0)_2, (1) and define b_n=sum_(i=0)^(k-1)epsilon_iepsilon_(i+1) (2) as the number of digits ...

Rule 102 is one of the elementary cellular automaton rules introduced by Stephen Wolfram in 1983 (Wolfram 1983, 2002). It specifies the next color in a cell, depending on its ...

Rule 110 is one of the elementary cellular automaton rules introduced by Stephen Wolfram in 1983 (Wolfram 1983, 2002). It specifies the next color in a cell, depending on its ...

Sangaku problems, often written "san gaku," are geometric problems of the type found on devotional mathematical wooden tablets ("sangaku") which were hung under the roofs of ...

The Schröder number S_n is the number of lattice paths in the Cartesian plane that start at (0, 0), end at (n,n), contain no points above the line y=x, and are composed only ...

If two similar figures lie in the plane but do not have parallel sides (i.e., they are similar but not homothetic), there exists a center of similitude, also called a ...

Sphere tetrahedron picking is the selection of quadruples of of points corresponding to vertices of a tetrahedron with vertices on the surface of a sphere. n random ...

Given two circles with one interior to the other, if small tangent circles can be inscribed around the region between the two circles such that the final circle is tangent to ...