Search Results for ""

A planar connected graph is a graph which is both planar and connected. The numbers of planar connected graphs with n=1, 2, ... nodes are 1, 1, 2, 6, 20, 99, 646, 5974, ...

The Games graph is a strongly regular graph on 729 vertices with parameters (nu,k,lambda,mu)=(729,112,1,20). It is distance-regular but not distance-transitive with ...

A (v,g)-cage graph is a v-regular graph of girth g having the minimum possible number of nodes. When v is not explicitly stated, the term "g-cage" generally refers to a ...

A graph is planar if it can be drawn in a plane without graph edges crossing (i.e., it has graph crossing number 0). The number of planar graphs with n=1, 2, ... nodes are 1, ...

The half-normal distribution is a normal distribution with mean 0 and parameter theta limited to the domain x in [0,infty). It has probability and distribution functions ...

A method to obtain a signal C_l(z) with a flat spectrum c(theta;z) (such as a pulse), but having a smaller amplitude than the pulse. ...

A graph embedding, sometimes also called a graph drawing, is a particular drawing of a graph. Graph embeddings are most commonly drawn in the plane, but may also be ...

Let G be a finite, connected, undirected graph with graph diameter d(G) and graph distance d(u,v) between vertices u and v. A radio labeling of a graph G is labeling using ...

The rhombic triacontahedral graph is Archimedean dual graph which is the skeleton of the rhombic triacontahedron, great rhombic triacontahedron, and small triambic ...

A white bishop graph is a graph formed from possible moves of a bishop chess piece, which may make diagonal moves of any length on a chessboard (or any other board), when ...