Search Results for ""

A generalized hexagon is a generalized polygon of order 6. GH(1,2) is more commonly known as the Heawood graph, but is also the (3,6)-cage graph, the cubic vertex-transitive ...

A tree G^' whose graph vertices and graph edges form subsets of the graph vertices and graph edges of a given tree G.

In a game proposed by J. H. Conway, a devil chases an angel on an infinite chessboard. At each move, the devil can eliminate one of the squares, and the angel can make a leap ...

A square matrix A such that the matrix power A^(k+1)=A for k a positive integer is called a periodic matrix. If k is the least such integer, then the matrix is said to have ...

The algorithm of constructing and interpreting a quotient-difference table which allows interconversion of continued fractions, power series, and rational functions ...

A category modeled after the properties of the category of sets. A category E is a topos if E has finite limits and every object of E has a power object (Barr and Wells 1985, ...

A graph vertex in a graph is said to be an odd node if its vertex degree is odd.

An integral embedding of a graph, not to be confused with an integral graph, is a graph drawn such that vertices are distinct points and all graph edges have integer lengths. ...

A tetramagic cube is a magic cube that remains magic when all its numbers are squared, cubed, and taken to the fourth power. Only two tetramagic cubes are known, and both ...

A point v is a central point of a graph if the eccentricity of the point equals the graph radius. The set of all central points is called the graph center.