Search Results for ""

The tritetrahedral graph is the skeleton of the tritetrahedron, a concave polyhedron formed by joining three regular tetrahedra at their faces. The Nechushtan graph, a ...

The great rhombicuboctahedral graph is the cubic Archimedean graph on 48 nodes and 72 edges that is the skeleton of the great rhombicuboctahedron as well as the great ...

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

A Lucas cube graph of order n is a graph that can be defined based on the n-Fibonacci cube graph by forbidding vertex strings that have a 1 both in the first and last ...

The Norton-Smith graph is a weakly regular graph on 1134 vertices with regular parameters (nu,k,lambda,mu)=(1134,117,36,(0,12)). It is distance-regular as well as ...

Given a planar graph G, its geometric dual G^* is constructed by placing a vertex in each region of G (including the exterior region) and, if two regions have an edge x in ...

The large Witt graph, also called the octad graph (Brouwer) or Witt graph (DistanceRegular.org), is the graph whose vertices are the 759 blocks of a Steiner system S(5,8,24) ...

The Grassmann graph J_q(n,k) is defined such that the vertices are the k-dimensional subspaces of an n-dimensional finite field of order q and edges correspond to pairs of ...

A kayak paddle graph KP(k,m,l) is the graph obtained by joining cycle graphs C_k and C_m by a path of length l (Gallian 2018). KP(3,3,1) is isomorphic to the 3-barbell graph. ...

A linklessly embeddable graph is a graph having the property that there exists an embedding in three dimensions that does not contain a nontrivial link. A graph is linklessly ...