Search Results for ""

The Hanoi graph H_n corresponding to the allowed moves in the tower of Hanoi problem. The above figure shows the Hanoi graphs for small n. The Hanoi graph H_n can be ...

The Harries-Wong graph is one of the three (3,10)-cage graphs, the other two being the (10,3)-cage known as the Balaban 10-cage and the Harries graph. The Harries-Wong graph ...

The Harries graph is one of the three (3,10)-cage graphs, the other two being the (10,3)-cage known as the Balaban 10-cage and the Harries-Wong graph. The Harries graph is ...

A hash function H projects a value from a set with many (or even an infinite number of) members to a value from a set with a fixed number of (fewer) members. Hash functions ...

There are a number of point processes which are called Hawkes processes and while many of these notions are similar, some are rather different. There are also different ...

The hemicubical graph is the skeleton of the hemicube. It has 7 vertices, 11 edges, and 6 faces. It is implemented in the Wolfram Language as GraphData["HemicubicalGraph"].

The hemiobelisk graph is the skeleton of the hemiobelisk. It has 7 vertices, 11 edges, and 6 faces. It is a minimal unit-distance forbidden graph. It is implemented in the ...

The smallest possible number of vertices a polyhedral nonhamiltonian graph can have is 11, and there exist 74 such graphs, including the Herschel graph and the Goldner-Harary ...

Highly composite numbers are numbers such that divisor function d(n)=sigma_0(n) (i.e., the number of divisors of n) is greater than for any smaller n. Superabundant numbers ...

The Hoffman graph is the bipartite graph on 16 nodes and 32 edges illustrated above that is cospectral to the tesseract graph Q_4 (Hoffman 1963, van Dam and Haemers 2003). ...