Search Results for ""

A Lucas cube graph of order n is a graph that can be defined based on the n-Fibonacci cube graph by forbidding vertex strings that have a 1 both in the first and last ...

Given four points chosen at random inside a unit cube, the average volume of the tetrahedron determined by these points is given by ...

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 pandiagonal perfect magic cube is a perfect magic cube that remains perfect when any single orthogonal section is "restacked" cyclically so that the ordering of any set of ...

The average number of regions into which n randomly chosen planes divide a cube is N^_(n)=1/(324)(2n+23)n(n-1)pi+n+1 (Finch 2003, p. 482). The maximum number of regions is ...

Consider the distribution of distances l between a point picked at random in the interior of a unit cube and on a face of the cube. The probability function, illustrated ...

Instead of picking two points from the interior of the cube, instead pick two points on different faces of the unit cube. In this case, the average distance between the ...

The polyhedron compound of the truncated cube and its dual, the small triakis octahedron. The compound can be constructed from a truncated cube of unit edge length by ...

A k-matrix is a kind of cube root of the identity matrix (distinct from the identity matrix) which is defined by the complex matrix k=[0 0 -i; i 0 0; 0 1 0]. It satisfies ...

The number 2^(1/3)=RadicalBox[2, 3] (the cube root of 2) which is to be constructed in the cube duplication problem. This number is not a Euclidean number although it is an ...