Simple Graph Types

In previous lessons, you learned about graph models and some basic graph terminologies.

In this lesson, you will learn about simple graph types, we learned earlier that a simple graph is one in which each edge has two unique vertices.

Simple Graph Types

The following is a list of simple graph types that we are going to explore.

1. Complete Graph
2. Cycles
3. Wheels
4. n-Cube
5. Bipartite Graph
6. Complete Bipartite Graph

Let us discuss each one them.

Complete Graph

A complete graph on n vertices, denoted by $latex K_n$ is a simple graph that contains exactly one edge between each pair of distinct vertices. It any edge from the pair of distinct vertices is not connected then it is called non-complete.

Here are some examples of complete graph.

Cycles

A cycle is denoted as $latex C_n$ where $latex n \geq 3$ consists of n vertices v₁, v₂, …, v_n and edges { v₁, v₂ }, { v₂, v₃ }, …, { v_n, v₁}.

Here are some examples of cycles.

Wheels

A wheel graph is easy to construct. You get a wheel, $latex W_n&s=1$ when you add an additional vertex to a cycle $latex C_n&s=1$, for $latex n \geq 3&s=1$ and place it in center of the cycle. This will connect each of the n vertices of cycle using new edges.

Some examples of wheels.

n-Cubes

A n-dimensional hyper-cube or n-cube is denoted by $latex Q_n&s=1$ is simple graph that has vertices representing the $latex 2^n&s=1$ bit-strings of length n.

In this scheme, two vertices are adjacent iff the bit strings differ only in one bit position. If this is confusing for you, see the following example.

Suppose $latex Q_1&s=1$ is given by following diagram.

The n-Cube, $latex Q1$ graph contains bit string length of 1. To construct $latex Q2$ from $latex Q1$ write another copy of $latex Q1$ and prefix 0 and 1 to each opposite end.

Similarly, to draw $latex Q3$ graph from $latex Q2$, do same as above, make a copy of $latex Q2$ and add 0 and 1 to opposite ends everywhere. Then join them by edges.

Bipartite Graphs

There is a special type of simple graph called bipartite graph. A simple graph $latex G$ is bipartite if its vertex set $latex V$ can be partitioned into two disjoint sets – $latex V1$ and $latex V2$, such that every edge in the graph $latex G$ connects a vertex in $latex V1$ and $latex V2$. It means no edge in $latex G$ connects two distinct vertices in either $latex V1$ or $latex V2$.

When this condition is holds, then you call the pair $latex (V1, V2)$ bi-partition of $latex V$ of graph $latex G$.

Consider following graphs.

In the first graph, the vertex set $latex V$ is divided into

$latex V1 = { S, R }$

$latex V2 = { A, B, C }$

This graph is a bipartite because there is no edge between nodes of same set. Every edge is connecting two vertices – one from each subset of $latex V$.

The second graph, the vertex set is divided into

$latex V1 = { A, B }$

$latex V2 = { C, D }$

This graph is not a bipartite because $latex A$ and $latex B$ has an edge and both $latex A$ and $latex B$ belong to subset $latex V1$.

Complete Bipartite Graph

If you recall, a complete graph is a graph $latex K_n&s=1$. However, a complete bipartite graph $latex K_{m,n}&s=1$ has its vertex set $latex V$ partitioned into m and n vertices, respectively with an edge between two vertices if and only if one vertex is in the first subset and the other vertex is in the second subset.

The total number of vertices in the set $latex V = m + n$ and the total number of edges is $latex E = m * n$ in a complete bipartite graph.