Scribd
Upload
8 views36 pages

Graph Theory

Gra

Uploaded by

mrffking178
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
8 views36 pages

Graph Theory

Gra

Uploaded by

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

Graph Theory

Index
• Isomorphism
• Chromatic Number
• Planar Graph
• Euler Graph
• Hamilton Graph
Graph Isomorphism
• The same graph exists in multiple
forms.
• Therefore, they are Isomorphic
graphs.
Graph Isomorphism Conditions-
• For any two graphs to be isomorphic, following 4 conditions must be
satisfied-
• Number of vertices in both the graphs must be same.
• Number of edges in both the graphs must be same.
• Degree sequence of both the graphs must be same.
• If a cycle of length k is formed by the vertices { v1 , v2 , ….. , vk } in one
graph, then a cycle of same length k must be formed by the vertices { f(v1) ,
f(v2) , ….. , f(vk) } in the other graph as well.
Graph Isomorphism
Degree Sequence
Degree sequence of a graph is defined as a sequence of the degree of all
the vertices in ascending order.
Important Points
• The above 4 conditions are just the necessary conditions for any two
graphs to be isomorphic.
• They are not at all sufficient to prove that the two graphs are
isomorphic.
• If all the 4 conditions satisfy, even then it can’t be said that the graphs
are surely isomorphic.
• However, if any condition violates, then it can be said that the graphs
are surely not isomorphic.
Sufficient Conditions-
• The following conditions are the sufficient conditions to prove any
two graphs isomorphic.
• If any one of these conditions satisfy, then it can be said that the
graphs are surely isomorphic.
Example - 1
Are the following two graphs isomorphic?
Example - 2
Example - 2
• two graphs are surely isomorphic if and only if their complement
graphs are isomorphic.
Example - 3
Graph Coloring
Chromatic Number
Chromatic Number
Planar Graph
• Planar graph is a graph that can be drawn in a plane such that none of
its edges cross each
Regions of Plane

• The planar representation of the graph splits the plane into connected
areas called as Regions of the plane.

• Each region has some degree associated with it given as-


• Degree of Interior region = Number of edges enclosing that region
• Degree of Exterior region = Number of edges exposed to that region
Regions of Plane
• Degree (R1) = 3
• Degree (R2) = 3
• Degree (R3) = 3
• Degree (R4) = 5
Planar Graph Properties
• Chromatic Number of any planar graph is always less than or equal to 4.
• Thus, any planar graph always requires maximum 4 colors for coloring its
vertices.
• In any planar graph, Sum of degrees of all the vertices = 2 x Total number of
edges in the graph
• In any planar graph, Sum of degrees of all the regions = 2 x Total number of
edges in the graph
• If G is a connected planar simple graph with ‘e’ edges, ‘v’ vertices and ‘r’
number of regions in the planar representation of G, then: r = e – v + 2.
This is known as Euler’s Formula.
• If G is a planar graph with k components, then: r = e – v + (k+1)
Example
Q Let G be a connected planar simple graph with 25 vertices and 60
edges. Find the number of regions in G.
Example
Q Let G be a connected planar simple graph with 25 vertices and 60
edges. Find the number of regions in G.
A
By Euler’s formula, we know r = e – v + 2.
Substituting the values, we get- Number of regions (r)
= 60 – 25 + 2
= 37
Example
• Let G be a connected planar simple graph with 35 regions, degree of
each region is 6. Find the number of vertices in G.
Example
Q Let G be a connected planar simple graph with 35 regions, degree of
each region is 6. Find the number of vertices in G.
A Sum of degrees of all the regions = 2 x Total number of edges
• Number of regions x Degree of each region = 2 x Total number of
edges
• 35 x 6 = 2 x e
• ∴ e = 105
Example
Q Let G be a connected planar graph with 12 vertices, 30 edges and
degree of each region is k. Find the value of k.
Example
Q Let G be a connected planar graph with 12 vertices, 30 edges and degree of
each region is k. Find the value of k.

• Substituting the values, we get-


• Number of regions (r)
• = 30 – 12 + 2
• = 20
• Sum of degrees of all the regions = 2 x Total number of edges
• Number of regions x Degree of each region = 2 x Total number of edges
• 20 x k = 2 x 30
•∴k=3
Euler Graph
• If there exists a Trail in the connected graph that contains all the
edges of the graph, then that trail is called as an Euler trail.
• OR

• If there exists a walk in the connected graph that visits every edge of
the graph exactly once with or without repeating the vertices, then
such a walk is called as an Euler walk.
• NOTE
• A graph will contain an Euler path if and only if it contains at most
two vertices of odd degree.
Find Euler Path
Euler Cycle
• An Euler trail that starts and ends at the same vertex is called as an
Euler circuit.
• A graph will contain an Euler circuit if and only if all its vertices are
of even degree.
Find Euler Circuit
Euler Path / Circuit
Hamilton Graph
• If there exists a closed walk in the connected graph that visits every
vertex of the graph exactly once (except starting vertex) without
repeating the edges, then such a graph is called as a Hamiltonian
graph.
• Any connected graph that contains a Hamiltonian circuit is called as a
Hamiltonian Graph.
Hamilton Path
• If there exists a walk in the connected graph that visits every vertex of
the graph exactly once without repeating the edges, then such a walk is
called as a Hamiltonian path.
• If there exists a Path in the connected graph that contains all the
vertices of the graph, then such a path is called as a Hamilton path.
• In Hamiltonian path, all the edges may or may not be covered but
edges must not repeat.
Example
Hamilton Circuit
• A Hamiltonian path which starts and ends at the same vertex is called
as a Hamiltonian circuit.
Example
Important Points
• Any Hamiltonian circuit can be converted to a Hamiltonian path by
removing one of its edges.
• Every graph that contains a Hamiltonian circuit also contains a
Hamiltonian path but vice versa is not true.
• There may exist more than one Hamiltonian paths and Hamiltonian
circuits in a graph.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy