Search Results for ""

A method for constructing magic squares of odd order, also called the Siamese method.

The E graph is the tree on 6 vertices illustrated above. It is isomorphic to the (3,2)-firecracker graph and 3-centipede graph. It is implemented in the Wolfram Language as ...

The Greenfield graph is the name given in this work to the 12-vertex graph illustrated above due to Greenfield (2011). This graph provided the first known example which ...

The Lemke graph is the 8-node graph with 13 edges illustrated above (Lemke and Kleitman 1989, Hurlbert 2011, Hurlbert 2013). The Lemke graph is the smallest graph that does ...

A graph G is the edge graph of a polyhedron iff G is a simple planar graph which is 3-connected.

An aperiodic tiling is a non-periodic tiling in which arbitrarily large periodic patches do not occur. A set of tiles is said to be aperiodic if they can form only ...

A fact noticed by physicist G. Gamow when he had an office on the second floor and physicist M. Stern had an office on the sixth floor of a seven-story building (Gamow and ...

One of the beautiful arrangements of circles found at the Temple of Osiris at Abydos, Egypt (Rawles 1997). The pattern also appears in Phoenician art from the 9th century BC ...

French curves are plastic (or wooden) templates having an edge composed of several different curves. French curves are used in drafting (or were before computer-aided design) ...

Various handshaking problems are in circulation, the most common one being the following. In a room of n people, how many different handshakes are possible? The answer is (n; ...