GRAPH THEORY

Here is where your presentation begins

Tazeen Zahra
Bs mathematics
GRAPH THEORY(HISTORY)
• Leonhard Euler’s paper on
“seven Bridges of Konigsberg”
• Publishes in 1736
• Problem: walk all 7 bridges without
crossing a bridge twice
WHAT IS GRAPH ?
It is a set of nodes joined by a set Vertex: a point, an intersection
of nodes joined by a set of lines or of two lines(edges)
arrows(collection of nodes and edges)

Edge: a line or curve connecting Loop: an edge that connects

two vertices a vertex itself
Types of graphs:

01 02 03
MULTIPLE SIMPLE GRAPH COMPLETE
GRAPH: A graph without
GRAPH
When any two loops and with at When each vertex
vertices are joined most one edge is connected by an
by more than one between any two edge to every other
edge vertices vertex
 GRAPH THEORY: cont.…
● Degree: the number of edges that enter or
exit from it
● complete graphs are commonly
designated Kn, where n refers to
the number of vertices, and all
vertices of Kn have degree n − 1
Path, walk, trail , and circuit:

Walk :
A walk consists of an alternating sequence of vertices and edges

consecutive elements of which are incident, that begins and ends with a
vertex. 
Path:
A path is a walk without repeated vertices.
Trail:
A trail is a walk without repeated edges.
Circuit:
A circuit is a walk that starts and ends at a same vertex, no repeated
edges.
Cycle:
 Vertices cannot repeat. Edges cannot repeat
 TWO MORE TYPEES OF GRAPH
UNDIRECTED
DIRECTED GRAPH
•
GRAPH
A type of graph that
• A type of graph that contain
contains unordered pairs
ordered pairs of vertices.
of vertices.
• Edges represent the
• Edges do not represent
direction of vertexes.
the direction of vertexes.
• An arrow represents the
• Undirected arcs represent
edges.
the edges.
APPLICATIONS OF GRAPH THEORY
• This kind of problem is known as the Euler tour, where you start and
finish at the same point without using the same line twice.
IN NETWORKING AND TRANSPORTATION
The Internet, for example, is a vast,
virtual graph. Every vertex is an individual
webpage, and every edge means that
there is a hyperlink between two
pages. Note that links only go one way,
so this graph is directed, and that this
graph is very, very, large.
All roads and motorways also form a large
network, which is used by navigation services
like Google Maps when working out the
shortest route between two given points.
One of the most recognizable graphs is the London
Underground map:
 SOME MORE APPLICATIONS

The different components Graphs also have many The links between atoms
of electric circuits and applications in probability,  in molecules and crystal grids
computer chips form a game theory and financial form a graph.
network. mathematics.
Thank you