==========================
Bipartite Graph : A bipartite graph is a graph G whose vertex set V can be partitioned into two non empty sets V1 and V2 in such a way that every edge of G joins a vertex in V1 to a vertex in V2.
Star Graph :Suppose we start with n vertices, choose one special vertex and then draw edges from the special vertex to every other vertex. The graph we would obtain is called thestar on n vertices, Sn
Wheel Graph :A wheel on n vertices Wn is a graph with n vertices x1, x2,..., xn, with x1 having degree n-1 and all the other vertices having degree 3. The vertex x1 is adjacent to all the other vertices, and for i=2, ..., n-1, xi is adjacent to xi+1, and xn-1 is adjacent to x2. We shall assume that n>3 in all the problems.
Fig 22.1, The wheel graph W51 |
Planar Graph:When a graph can be drawn without any of the edges crossing we say that it is a planar graph.
Complement of Graph : The complement of a graph G is a graph with the same vertex set as G but with an edge set such that xy is an edge in if and only if xy is not an edge in G.
Comments
Post a Comment