discrete presentation

CHAPTER-8
GRAPH THEORY
Introduction
◦Many structures involving real-world situations can be
conveniently represented on paper by means of a
diagram consisting of a set of points which are usually
drawn as small circles or dots which together are with
lines or curves joining some or all pairs of these points.
◦Graph theory can be described as a study of the graph.
A graph is a type of mathematical structure which is
used to show a particular function with the help of
connecting a set of points.
 Graphs are one of the prime objects to study in
Discrete Mathematics.
 The graph is created with the help of vertices

and edges. The vertices are also known as the
nodes, and edges are also known as the lines. In
any graph, the edges are used to connect the
vertices.
 We can use the application of linear graphs not

only in discrete mathematics, but we can also
use it in the field of Biology, Computer science,
Linguistics, Physics, Chemistry, etc. GPS (Global
positioning system) is the best real-life example
of graph structure because GPS has used to
track the path or to know about the road's
direction.
Few Examples of
how Graphs are
used as models
in variety of areas
◦ELECTRIC CIRCUITS:
Circuit elements like
transistors,resistors,and
capacitors are intricately
wired together.
◦ROAD NETWORKS AND

OTHER TRANSPORTATION
NETWORKS
The vertices represents cities
and edges represent the
roads.used for transportation
management, and many more
optimization problems.
THE INTERNET
Node are computers and
edges represents physical
wires connecting two
machines together.
THE WORLD WIDE WEB

The nodes are web pages,
and an edge represents a
hyperlink from one page to
another.
SOCIAL NETWORKS LIKE

FACEBOOK(OR LINKEDLN OR
INSTAGRAM OR…)
Here, the nodes are people, and an
edge is between two people
represents friendship
Definition of
Graph
◦ A Graph G consists of a set V of Vertices
[Nodes] and a set E of Edges[Arcs].
◦ We write G=(V,E). V is finite and Non-
Empty set of vertices. is a set of pairs of
vertices; these pairs are called Edges.
◦ Therefore(G),read as V of G,is a set of
vertices, and E(G),read as E of G,is a set of
edges.
◦ An edge e=(v,w),is a pair of vertices v and
w,and is said to be incident with v and w.
Example for
Definition of Graph
◦ The figure shows a graph with
◦ V(G)={A,B,C,D,E} and E(G)={(A,B),
(B,C),(A,D),(B,D),(D,E),(C,E)}.
◦ Note: there are Five vertices or
nodes and six edges in the Graph.
◦ The size of Graph is total number of
edges in it, In a Graph G=(V,E),the
sets V and E are assumed to be finite
sets.
◦ A Vertex of a Graph is called a
◦ Node, a point; a junction or 0-
cell.
◦ An Edge of a Graph is called a line,
a branch, a 1-cell or an arc.
Types of Graph:
There are basically two types of graphs, i.e., Undirected graph
and Directed graph.
Undirected Graph:
◦An Undirected graph is a pair G=(V,E), where V is as set of
whose elements are vertices, and E is a set of unordered
pairs of distinct elements of V.
◦Vertices are also called as Nodes. Elements of E are called
Edges, or undirected edges.
◦Each edge may be considered as a subset of V containing two
elements; consequently,(V,W) denotes and undirected edge.
◦ In Diagrams this edge is the line V→W. In undirected graphs
V→W is same as W→V.
Example for
Undirected Graph
◦The figure shows an
undirected graph
◦G=(V,E) where
◦V={1,2,3,4,5,6,7}
◦E={(1,2),(1,3),(1,4),(2,4),
(2,5),(3,4),(3,6),(4,5),(4,6),
(4,7),(5,7),(6,7)}
UNDIRECTED GRAPH
Directed Graph
◦A Directed Graph, or digraph, is a pair G=(V,E) where
V is set of whose elements are called vertices, and E
is set of ordered pairs of elements of V.
◦Vertices are also called Nodes. Elements of E are
called arcs or directed edges.
◦For directed edge (v,w) in E, ’v’ is its tail and ’w’ its
head.(v,w) is represented in the diagrams as the
arrow →w.
Example for
Directed Graph
◦ The below figure shows a directed graph
◦ G=(V,E) where
◦ V={1,2,3,4,5,6,7}
◦ E={(2,1),(3,2),(4,5),(3,4),(6,1),(6,7),
(7,2),(7,3)}.
◦ As shown, an edge (v,w) is drawn as an
arrow from V to W.
◦ In Directed graph, (v,w) is not as same
as (w,v).That means (6,1) is not as same
as (1,6).
Thank
Thank you you

discrete presentation

Uploaded by

Copyright:

Available Formats

discrete presentation

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

discrete presentation

Uploaded by

Copyright:

Available Formats

CHAPTER-8

 The graph is created with the help of vertices

 We can use the application of linear graphs not

◦ROAD NETWORKS AND

THE WORLD WIDE WEB

SOCIAL NETWORKS LIKE

You might also like