Standard Random Graphs :

Input : number of edges n and a probability p \in ]0,1[. The parameter p, specifies the probability thata any
given pair of vertices constitutes an edge. How to generate ?

For each potential arc (i,j): • generate a random number r (r \in [0, 1]), • if r \leq p , then include arc (i,j),
otherwise exclude arc (i,j).

(Note that that the expected average vertex degree is p \times (n - 1).)

Geometric Random Graphs

Input : n vertices and d

How to generate ? First, pick 2n independent numbers uniformly from the interval ]0, 1[, and view these as the
coordinates of n points in the unit square (each point has two coordinates). These points represent the
vertices; we place an edge between two vertices if and only if their (Euclidean) distance is d or less. (Notice
htat Note that for points not too close to the boundary the expected average degree will be approximately
n\pi d^2.)

Caterpillar graphs :

Input : a the size of spine and b the number of legs in each vertex of the spine

It is constructed by starting with a straight line (the spine) of size a, where each vertex has degree two except
the outermost vertices. Each vertex on the spine (including the outermost) is then connected to b new
vertices, called the legs of the caterpillar. (Note that the total number of nodes is a \times (b+1) and the
number of edges is b \times a + (a-1) = a \times (b+1) - 1)

In the following example, the size of the spine is 5 vertices and the number of legs is 4 for each vertex.
 

Grid graphs :

Input : n= x \times y nodes (x =height and y = weight)

In the following example x= 4, y=7