Search Results for ""

There exists no known P algorithm for graph isomorphism testing, although the problem has also not been shown to be NP-complete. In fact, the problem of identifying ...

An orientation of an undirected graph G is an assignment of exactly one direction to each of the edges of G. Only connected, bridgeless graphs can have a strong orientation ...

A lattice L is said to be oriented if there exists a rule which assigns a specified direction to any edge connecting arbitrary lattice points x_i,x_j in L. In that way, an ...

An encoding which provides a bijection between the n^(n-2) labeled trees on n nodes and strings of n-2 integers chosen from an alphabet of the numbers 1 to n. A labeled tree ...

The m×n queen graph Q_(m,n) is a graph with mn vertices in which each vertex represents a square in an m×n chessboard, and each edge corresponds to a legal move by a queen. ...

An alkane graph is a tree in which vertices correspond to atoms and edges to carbon-carbon or hydrogen-carbon bonds in a chemical alkane. In chemistry, an alkane is an ...

A cubic nonplanar graph is a graph that is both cubic and nonplanar. The following table summarizes some named nonplanar cubic graphs. graph G |V(G)| utility graph 6 Petersen ...

The cyclotomic graph of order q with q a prime power is a graph on q nodes with two nodes adjacent if their difference is a cube in the finite field GF(q). This graph is ...

A giraffe graph is a graph formed by all possible moves of a hypothetical chess piece called a "giraffe" which moves analogously to a knight except that it is restricted to ...

The Hochberg-O'Donnell fish graph is the unit-distance graph on 23 nodes and 42 edges illustrated above. It is triangle-free and is the smallest example of a unit-distance ...