Search Results for ""

The bull graph is a simple graph on 5 nodes and 5 edges whose name derives from its resemblance to a schematic illustration of a bull or ram (whose face is the triangle and ...

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

"The" butterfly graph is a name sometimes given to the 5-vertex graph illustrated above. This graph is also known as the "bowtie graph" (West 2000, p. 12) and is the ...

The Möbius-Kantor graph is the unique cubic symmetric graph on 16 nodes, illustrated above in several embeddings. Its unique canonical LCF notation is [5,-5]^8. The ...

The cubical graph is the Platonic graph corresponding to the connectivity of the cube. It is isomorphic to the generalized Petersen graph GP(4,1), bipartite Kneser graph ...

The Klein graph is a weakly regular graph that is the dual graph of the cubic symmetric graph F_(056)B. The Klein graph is illustrated above in four order-4 LCF notations. ...

The wreath graph W(n,k) is the graph obtained by taking n collections of k nodes and arranging around a circle such that all nodes in adjacent collections are connected. ...

The Pappus graph is a cubic symmetric distance-regular graph on 18 vertices, illustrated above in three embeddings. It is Hamiltonian and can be represented in LCF notation ...

The pentagonal hexecontahedral graph is the Archimedean dual graph which is the skeleton of the pentagonal hexecontahedron. It is implemented in the Wolfram Language as ...

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