Some Special Simple Graph

A) Complete Graph:

                 A simple graph that contains exactly one edge between every pair of vertices. The complete graph on n vertices is denoted by Kn

Note: The number of edges in Kn=n(n-1)/2

B) Regular Graph:

              A simple graph in which all vertices are of equal degree is called a regular graph. If every vertex in regular graph has degree k, then the graph is called k - regular.

C) Cycle: 

      The graph consists of n (n >=3) vertices v1,v2,v3....vn and edges e1,e2,...en. The cycle of n vertices denoted by Cn.

D)Wheel: 

     When an additional vertex to the cycle Cn (n>=3) is added and connect that new vertex to each of n vertices in Cn by new edges.

F) Bipartite Graph:

     A simple graph G(V,E) is called bipartite if its vertex set V can be into disjoint subsets V1 & V2 such that every edge in the graph connects a vertices in V1 & a vertices V2  i.e,  no edge in G connects either two vertices in V1 or two vertices in V2.