Search Results for ""

The Meringer graph is one of the four (5,5)-cage graphs, discovered by Meringer (1999) after it had long been thought that only three such cages existed. Like the other ...

A nonhamiltonian graph is a graph that is not Hamiltonian. All disconnected graphs are therefore nonhamiltoinian, as are acylic graphs. Classes of connected graphs that are ...

The composition G=G_1[G_2] of graphs G_1 and G_2 with disjoint point sets V_1 and V_2 and edge sets X_1 and X_2 is the graph with point vertex V_1×V_2 and u=(u_1,u_2) ...

The deltoidal hexecontahedral graph is an Archimedean dual graph which is the skeleton of the deltoidal hexecontahedron as well as the rhombic hexecontahedron. It is ...

A prime-distance graph is a distance graph with distance set given by the set of prime numbers.

A rolling polyhedron graph is a graph obtained by rolling a polyhedral solid along a board whose tiles match up with the faces of the polyhedron being rolled. The vertices of ...

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 closed graph theorem states that a linear operator between two Banach spaces X and Y is continuous iff it has a closed graph, where the "graph" {(x,f(x)):x in X} is ...

The pentagonal wedge graph is the skeleton of the pentagonal wedge. It is a has 8 vertices, 12 edges, and 6 faces. The pentagonal wedge graph is implemented in the Wolfram ...

The deltoidal icositetrahedral graph is Archimedean dual graph which is the skeleton of the deltoidal icositetrahedron. It is implemented in the Wolfram Language as ...