Search Results for ""

A map which uses a set of rules to transform elements of a sequence into a new sequence using a set of rules which "translate" from the original sequence to its ...

The Suetake graph is a weakly regular Hamiltonian graph on 231 vertices with parameters (nu,k,lambda,mu)=(72,(12),(0),(0,4)). It is distance-regular with intersection array ...

A Taylor graph is a distance-regular graph with intersection array {k,mu,1;1,mu,k}. A Taylor graph with these parameters has 2(k+1) vertices. The crown graphs K_2 square ...

A matrix for a round-robin tournament involving n players competing in n(n-1)/2 matches (no ties allowed) having entries a_(ij)={1 if player i defeats player j; -1 if player ...

A triangle-replaced graph T(G) is a cubic graph in which each vertex is replaced by a triangle graph such that each vertex of the triangle is connected to one of the ...

The above two figures are rearrangements of each other, with the corresponding triangles and polyominoes having the same areas. Nevertheless, the bottom figure has an area ...

The tribox, also called the Penrose rectangle or Penrose square, is an impossible figure that is the generalization of the Penrose triangle from a triangle to a square. ...

A trip-let is a three-dimensional solid that is shaped in such a way that its projections along three mutually perpendicular axes are three different letters of the alphabet. ...

Let G(V,E) be a graph with graph vertices V and graph edges E on n graph vertices without a (k+1)-clique. Then t(n,k)<=((k-1)n^2)/(2k), where t(n,k) is the edge count. (Note ...

Tutte's wheel theorem states that every polyhedral graph can be derived from a wheel graph via repeated graph contraction and edge splitting. For example, the figure above ...