0% found this document useful (0 votes)
21 views20 pages

Sarita Jangra

This self-study paper on Graph Theory is submitted by Sarita for the Master of Science degree at Chaudhary Bansi Lal University, detailing various aspects of graph theory including definitions, types of graphs, graph coloring, and applications. The document acknowledges the guidance of the supervisor and outlines key concepts such as directed and undirected graphs, the Handshaking Lemma, and the chromatic number. It also provides examples and references for further reading.

Uploaded by

Sarita Jangra
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
0% found this document useful (0 votes)
21 views20 pages

Sarita Jangra

This self-study paper on Graph Theory is submitted by Sarita for the Master of Science degree at Chaudhary Bansi Lal University, detailing various aspects of graph theory including definitions, types of graphs, graph coloring, and applications. The document acknowledges the guidance of the supervisor and outlines key concepts such as directed and undirected graphs, the Handshaking Lemma, and the chromatic number. It also provides examples and references for further reading.

Uploaded by

Sarita Jangra
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/ 20

GRAPH THEORY

A
Self Study Paper
in partial fulfilment
For the award of degree of
MASTER OF SCIENCE
In department of Mathematics
2023 - 24

CHAUDHARY BANSI LAL UNIVERSITY ,BHIWANI, HARYANA

SUPERVISOR Submitted By
Mrs. Pooja Name : Sarita
Assist. Prof. of Roll No. : 2221021
mathematics
Class : M.Sc final Year
J.V.M.G.R.R. COLLEGE
CHARKHI DADRI
ACKNOWLEDGEMENT

I would like to express my special thanks of gratitude to my


teacher Mrs. Pooja as well as our head of the Department
Mrs. Lata who gave me the golden opportunity to do this
wonderful project on the topic GRAPH THEORY which
also helped me in doing a lot of research and I came
to know about so many new things . I am really
thankful to them.
CONTENTS
• Introduction
• Graphs
• Examples of graphs
• Types of Graphs
• Examples of types of graphs
• Graph Colouring
• Chromatic Number
• Handshaking Lemma
• Directed and undirected graphs
• Examples
• Applications
Introduction
Graph Theory is the study of points and lines.
In particular ,it involves the ways in which sets
of points, called vertices, can be connected by
lines called edges.
Graph Theory has proven useful in the design
of integrated circuits for computer and other
electronic devices.
Graph Theory was invented by Leonhard Euler.
Graphs and Basic
Terminologies
• A graph G=(V, E) is a structure consisting of a set of
objects called vertices V and a set of objects called
edges E.

• An edge is associated with a set consisting of either one


or two vertices called its endpoints.

• A graph may be directed or undirected,weighted or


unweighted.

• A Graph may be with self loop.


Example Of Graphs

weighted graph

graph with self loop


types of graphs
Null Graph:- A graph whose vertex set and
edges set are empty is called a null graph.
Regular Graph:-If each vertex of a graph G
has same degree as every other vertex,then G
is called a regular graph.
Complete Graph:- A complete graph is a
graph in which each pair of vertices is joined by
an edge.
TYPES OF
GRAPHS
Bipartite Graph:- a bipartite graph G is a graph whose
vertex set V can be partitioned into two subsets U and W
such that each edge of G has one endpoint in U and one
endpoint in W.
Complete Bipartite Graph:- In a complete bipartite graph
the vertex set is the union of two disjoint sets U and W so
that every vertex in U is adjacent to every vertex in W but
there are no edges with U or W.
EXAMPLES OF TYPES OF
GRAPHS

Null Graph

Regular Graph

Complete Graph
EXAMPLES OF TYPES OF
GRAPHS

Bipartite Graph Complete


Bipartite Graph
GRAPH
COLOURING
Graph Coloring is a method to assign colours to the vertices of
a graph so that no two adjacent vertices have same colour.
Some graph colouring problems are:-
Vertex colouring:- A way of colouring vertex of a graph so that
no two adjacent vertices of graph share the same colour.
Edge Colouring:- It is a method to assign colour to each edge
so that no two adjacent edges have the same color.
Face Coloring:-It assigns a color to each face or region of
planar graph so that no two faces that share the same
boundary have same color.
CHROMATIC
NUMBER
Chromatic number is the minimum number of colours required
to colour a graph.
Handshaking Lemma
Theorem: The graph G with e no. of edges & n no. of vertices, since each

edge contributes two degree, the sum of the degrees of all vertices in G is

twice no. of edges in G.


n

i.e.  d(vi)=2e is called as Handshaking Lemma.


i=1

Example: How many edges are there in a graph with 10 vertices, each of

degree 6? Solution: The sum of the degrees of the vertices is 6*10 = 60.

According to the Handshaking Theorem, it follows that 2e = 60, so there are

30 edges.
DIRECTED AND UNDIRECTED
GRAPH
Directed Graph:- A graph is called directed
graph if each edge is associated with a
direction.
Undirected Graph:- A graph is called
undirected graph if each edge is not associated
with direction.
EXAMPLES

Undirected Directed Graph


Graph
APPLICATIONS
Computer networks
Distinguish between two chemical compounds
with the same molecular formula but different
structures
Solve shortest path problems between cities
Scheduling exams and assign channels to
television stations
REFERENCES
• Introduction To Graph Theory
By Richard J Trudeau

• https://www.slideshare.net
• https://slideplayer.com/slide/8833047/

• Graph Theory PPT PDF Lecture Notes ENGINEERING PPT


https://www.engppt.com › 2012/06 › graph-theory-pp...

• Slides for Rosen, 5th edition


i
James Madison University
https://users.cs.jmu.edu › Module-22-Graphs
ANY QUERY
THANK
YOU

You might also like