Scribd
Upload
76 views

2 - Types of Graph

The document defines and provides examples of different types of graphs including directed graphs, complete graphs, bipartite graphs, isomorphic graphs, planar graphs, Euler graphs, and Hamiltonian graphs. It specifically discusses properties of bipartite graphs like their vertex partitioning and examples like the cycle graph C6. It also covers concepts like complete bipartite graphs Km,n, subgraphs, graph isomorphism, and Euler's formula for planar graphs.

Uploaded by

Digvijay Singh Kathuria
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
76 views

2 - Types of Graph

The document defines and provides examples of different types of graphs including directed graphs, complete graphs, bipartite graphs, isomorphic graphs, planar graphs, Euler graphs, and Hamiltonian graphs. It specifically discusses properties of bipartite graphs like their vertex partitioning and examples like the cycle graph C6. It also covers concepts like complete bipartite graphs Km,n, subgraphs, graph isomorphism, and Euler's formula for planar graphs.

Uploaded by

Digvijay Singh Kathuria
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 23

Types of Graph

Graphs
Types of Graph
• Directed Graph
• Complete Graph
• Bipartite Graph
• Isomorphic Graph
• Planar Graph
• Euler Graph
• Hamiltonian Graph
Bipartite Graph
• A simple graph G is called bipartite if its vertex
set V can be partitioned into two disjoint sets
V1 and V2 such that every edge in the graph
connects a vertex in V1 and a vertex in V2
• No edge in G connects either two vertices in
V1 or two vertices in V2
• When this condition holds, we call the pair
(V1, V2) a bipartition of the vertex set V of G.
Bipartite Graph
• Red vertices are in one set
• Black vertices are in another set
Bipartite Graph
• C6 (cycle graph of length 6) is bipartite,
because its vertex set can be partitioned into
the two sets V1 = {v1, v3, v5} and V2 = {v2, v4,
v6}, and every edge of C6 connects a vertex in
V1 and a vertex in V2.
Theorem
• A simple graph is bipartite if and only if it is
possible to assign one of two different colors
to each vertex of the graph so that no two
adjacent vertices are assigned the same color.
Complete Bipartite Graphs
• The complete bipartite graph Km,n is the
graph that has its vertex set partitioned into
two subsets of m and n vertices, respectively
such that every vertex of the first set is
connected to every vertex of the second set.
Complete Bipartite Graphs
• The complete bipartite graphs K2,3, K3,3,
K3,5, and K2,6 are as follows:
Subgraph
• A subgraph of a graph G = (V, E) is a graph
H = (W, F), where W  V and F  E. A subgraph
H of G is a proper subgraph of G if H  G
Eg. A subgraph of K5 is as follows:
Isomorphism
• The simple graphs G1 = (V1, E1) and G2 = (V2, E2) are
isomorphic if there is a one-to-one and onto function
f from V1 to V2 with the property that a and b are
adjacent in G1 if and only if f(a) and f(b) are adjacent
in G2, for all a and b in V1. Such a function f is called
an isomorphism.
• In other words, when two simple graphs are
isomorphic, there is a one-to-one correspondence
between vertices of the two graphs that preserves
the adjacency relationship.
Isomorphism
• Isomorphic simple graphs must have the same
number of edges
• the degrees of the vertices in isomorphic
simple graphs must be the same.
Isomorphism
• The number of vertices, the number of edges,
and the number of vertices of each degree are
all invariants under isomorphism. If any of
these quantities differ in two simple graphs,
these graphs cannot be isomorphic.
Problem
Show that the graphs G = (V, E) and H = (W, F),
displayed in Figure, are isomorphic.

Solution: The function f with f(u1) = v1, f(u2) = v4,


f(u3) = v3, and f(u4) = v2 is a one-to-one
correspondence between V and W.
To see that this correspondence preserves
adjacency, note that adjacent vertices in G are u1
and u2, u1and u3, u2 and u4, and u3 and u4, and
each of the pairs f(u1) = v1 and f(u2) = v4, f(u1) =
v1 and f(u3) = v3, f(u2) = v4 and f(u4) = v2, and
f(u3) = v3 and f(u4) = v2 are adjacent in H.
Therefore Isomorphic
Problem

Show that graphs displayed in Figure are not


isomorphic.
Solution: Both G and H have five vertices and six
edges. However, H has a vertex of degree one,
namely, e, whereas G has no vertices of degree one.
It follows that G and H are not isomorphic .
• Determine whether the graphs shown in Figure are isomorphic.

• Solution: The graphs G and H both have eight vertices and 10 edges. They
also both have four vertices of degree two and four of degree three. Because
these invariants all agree
• However, G and H are not isomorphic.
• To see this, note that because deg(a) = 2 in G, a must correspond to either t,
u, x, or y in H, because these are the vertices of degree two in H. However,
each of these four vertices in H is adjacent to another vertex of degree two in
H, which is not true for a in G.
Planar Graphs

• A graph is called planar if it can be drawn in the plane without


any edges crossing (where a crossing of edges is the
intersection of the lines or arcs representing them at a point
other than their common endpoint). Such a drawing is called
a planar representation of the graph.
Planar Graphs
Planar Graphs
• A graph may be planar even if it is usually drawn with
crossings, because it may be possible to draw it in a different
way without crossings.
• Is K4 planar?

K4 is planar because it can be


drawn without crossings
Planar Graphs
• Is K3,3 planar?
Planar Graphs
• Solution: Any attempt to draw K3,3 in the plane with no edges crossing is doomed.
• We now show why.
• In any planar representation of K3,3, the vertices V1 and V2 must be connected to
both V4 and V5. These four edges form a closed curve that splits the plane into two
regions, R1 and R2.The vertex V3 is in either R1 or R2. When V3 is in R2, the
edges between V3 and V4 and between V3 and V5 separate R2 into two
subregions, R21 and R22.

• Next, note that there is no way to place the final vertex V6 without forcing a
crossing. If V6 is in R1, then the edge between V6 and V3 cannot be drawn without
a crossing. If V6 is in R 21 , then the edge between V2 and V6 cannot be drawn
without a crossing. If V6 is in R22, then the edge between V1 and V6 cannot be
drawn without a crossing.

• Therefore, K3,3 is not planar.


Planar Graphs
• A planar representation of a graph splits the plane
into regions, including an unbounded region

• This is the basis for Euler’s Formula


EULER'S FORMULA
• Let G be a connected planar simple graph with
e edges and v vertices. Let r be the number of
regions in a planar representation of G.
Then r = e - v + 2.
Example
• Suppose that a connected planar simple graph has 20
vertices, each of degree 3. Into how many regions does
a representation of this planar graph split the plane?
• Solution:
• This graph has 20 vertices, each of degree 3, so v = 20.
Because the sum of the degrees of the vertices,
• 3v = 3 ·20 = 60, is equal to twice the number of edges,
2e, we have 2e = 60, or e = 30. (by Handshaking Theorem)
• Consequently, from Euler's formula, the number of
regions is r = e - v + 2 = 30 - 20 + 2 = 12.

You might also like