Search Results for ""

The gear graph, also sometimes known as a bipartite wheel graph (Brandstädt et al. 1987), is a wheel graph with a graph vertex added between each pair of adjacent graph ...

The gem graph is the fan graph F_(4,1) illustrated above. It is implemented in the Wolfram Language as GraphData["GemGraph"].

The great snub dodecicosidodecahedral graph is the skeleton of the great snub dodecicosidodecahedron, illustrated above in a few embeddings. It will be implemented in a ...

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" H graph is the tree on 6 vertices illustrated above. It is implemented in the Wolfram Language as GraphData["HGraph"]. The term "H-graph" is also used to refer to a ...

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

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