Search Results for ""

The skeleton of the bislit cube is the 8-vertex simple graph, illustrated above in several embeddings, which consists of a cube in which two opposite faces have polyhedron ...

A Hamiltonian walk on a connected graph is a closed walk of minimal length which visits every vertex of a graph (and may visit vertices and edges multiple times). For ...

The Krackhardt kite is the simple graph on 10 nodes and 18 edges illustrated above. It arises in social network theory. It is implemented in the Wolfram Language as ...

The moth graph is the 6-vertex graph illustrated above. It is implemented in the Wolfram Language as GraphData["MothGraph"].

A polyhedral graph corresponding to the skeleton of a Platonic solid. The five platonic graphs, the tetrahedral graph, cubical graph, octahedral graph, dodecahedral graph, ...

The small triakis octahedron graph is Archimedean dual graph which is the skeleton of the small triakis octahedron. It is implemented in the Wolfram Language as ...

A stacked (or generalized) prism graph Y_(m,n) is a simple graph given by the graph Cartesian product Y_(m,n)=C_m square P_n (Gallian 2007) for positive integers m,n with ...

Let f be a fractional coloring of a graph G. Then the sum of values of f is called its weight, and the minimum possible weight of a fractional coloring is called the ...

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

Two graphs which contain the same number of graph vertices connected in the same way are said to be isomorphic. Formally, two graphs G and H with graph vertices ...