Search Results for ""

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

"Vertex" is a synonym for a node of a graph, i.e., one of the points on which the graph is defined and which may be connected by graph edges. The terms "point," "junction," ...

The Clebsch graph, also known as the Greenwood-Gleason graph (Read and Wilson, 1998, p. 284) and illustrated above in a number of embeddings, is a strongly regular quintic ...

A Laman graph is a graph satisfying Laman's theorem. In other words, it is a graph G have exactly 2n-3 graph edges, where n is the number of graph vertices in G and for which ...

Cubic symmetric graphs are sometimes called Foster graphs and denoted F_(nnn)X, where nnn is the vertex count and X is a letter A, B, C, ... indicating the particular such ...

The Dyck graph is unique cubic symmetric graph on 32 nodes, illustrated above in a number of embeddings. It is denoted F_(032)A in the Foster census of cubic symmetric graphs ...

The Dejter graph is a weakly regular graph on 112 vertices and 336 edges with regular paremeters (nu,k,lambda,mu)=(112,6,0,(0,1,2)). It can be obtained by deleting a copy of ...

An intrinsically linked graph is a graph having the property that any embedding of it in three dimensions contains a nontrivial link. A graph is intrinsically linked iff it ...

The kth power of a graph G is a graph with the same set of vertices as G and an edge between two vertices iff there is a path of length at most k between them (Skiena 1990, ...

The (weak) Bruhat graph B_n of order n is the simple graph having have all permutations of {1,2,...,n} as vertices, and with an edge between pairs of permutations that differ ...