Search Results for ""

The pentakis dodecahedral graph is Archimedean dual graph which is the skeleton of the disdyakis triacontahedron. It is implemented in the Wolfram Language as ...

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

The union G=G_1 union 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 V=V_1 union V_2 and X=X_1 union X_2 (Harary ...

A random graph is a graph in which properties such as the number of graph vertices, graph edges, and connections between them are determined in some random way. The graphs ...

The dodecadodecahedral graph is the skeleton of the dodecadodecahedron, great dodecahemicosahedron, and small dodecahemicosahedron. It is illustrated above in several ...

The cubeplex graph is the cubic Hamiltonian graph on 12 nodes illustrated above in several embeddings and corresponding to the graph Gamma_1 in Fischer and Little (2001). It ...

The Markström graph is a cubic planar graph on 24 vertices which lacks cycles of length 4 and 8 but contains cycles of length 16. (In particular, it contains cycles of ...

An ungraceful graph is a simple graph that does not possess a graceful labeling, i.e., a graph that is not a graceful graph (Gardner 1972). Such graphs have also been termed ...

Given a function f(x_1,...,x_n) defined on a domain U, the graph of f is defined as the set of points (which often form a curve or surface) showing the values taken by f over ...

A symmetric graph is a graph that is both edge- and vertex-transitive (Holton and Sheehan 1993, p. 209). However, care must be taken with this definition since arc-transitive ...