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 ...

Also called the ménage problem. In how many ways can n married couples be seated around a circular table in such a manner than there is always one man between two women and ...

The triangle DeltaM_AM_BM_C formed by joining the midpoints of the sides of a triangle DeltaABC. The medial triangle is sometimes also called the auxiliary triangle (Dixon ...

The Moser spindle is the 7-node unit-distance graph illustrated above (Read and Wilson 1998, p. 187). It is sometimes called the Hajós graph (e.g., Bondy and Murty 2008. p. ...

A hyperboloid is a quadratic surface which may be one- or two-sheeted. The one-sheeted hyperboloid is a surface of revolution obtained by rotating a hyperbola about the ...

Operations research is a vast branch of mathematics which encompasses many diverse areas of minimization and optimization. Thousands of books have been written worldwide on ...

The Paulus graphs are the 15 strongly regular graphs on 25 nodes with parameters (nu,k,lambda,mu)=(25,12,5,6) and the 10 strongly regular graphs on 26 nodes with parameters ...

The Penrose tiles are a pair of shapes that tile the plane only aperiodically (when the markings are constrained to match at borders). These two tiles, illustrated above, are ...

A perfect matching of a graph is a matching (i.e., an independent edge set) in which every vertex of the graph is incident to exactly one edge of the matching. A perfect ...

Probability is the branch of mathematics that studies the possible outcomes of given events together with the outcomes' relative likelihoods and distributions. In common ...