Search Results for ""

The cube-connected cycle graph of order n is the graph obtained by replacing each vertex in a n-dimensional hypercube by a cycle of length n. They were introduced by ...

A cube can be divided into n subcubes for only n=1, 8, 15, 20, 22, 27, 29, 34, 36, 38, 39, 41, 43, 45, 46, and n>=48 (OEIS A014544; Hadwiger 1946; Scott 1947; Gardner 1992, ...

The dimension of an object is a topological measure of the size of its covering properties. Roughly speaking, it is the number of coordinates needed to specify a point on the ...

An equilateral triangle is a triangle with all three sides of equal length a, corresponding to what could also be known as a "regular" triangle. An equilateral triangle is ...

Cubic symmetric graphs are sometimes called Foster graphs and denoted F_(nnn)X, where nnn is the vertex count and X is a letter A, B, C, ... indicating the particular such ...

Hex is a two-player game invented by Piet Hein in 1942 while a student at Niels Bohr's Institute for Theoretical Physics, and subsequently and independently by John Nash in ...

"The" H graph is the tree on 6 vertices illustrated above. It is implemented in the Wolfram Language as GraphData["HGraph"]. The term "H-graph" is also used to refer to a ...

A Hamilton decomposition (also called a Hamiltonian decomposition; Bosák 1990, p. 123) of a Hamiltonian regular graph is a partition of its edge set into Hamiltonian cycles. ...

Consider the plane quartic curve X defined by x^3y+y^3z+z^3x=0, where homogeneous coordinates have been used here so that z can be considered a parameter (the plot above ...

Linear algebra is the study of linear sets of equations and their transformation properties. Linear algebra allows the analysis of rotations in space, least squares fitting, ...