Scribd
Upload
103 views11 pages

Ramya

This presentation provides an introduction to graph theory. It discusses how graph theory was originally motivated by problems involving games of chance and recreational mathematics. It then provides two main situations where graphs are used: 1) to represent relationships between objects and 2) as mathematical models to solve problems and interpret their solutions. The document outlines common types of problems in graph theory such as existence, construction, enumeration, and optimization problems. It provides some classic examples and concludes with a brief history of graph theory originating from Euler's Konigsberg bridges problem in 1735.

Uploaded by

Mark Arokiasamy
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
103 views11 pages

Ramya

This presentation provides an introduction to graph theory. It discusses how graph theory was originally motivated by problems involving games of chance and recreational mathematics. It then provides two main situations where graphs are used: 1) to represent relationships between objects and 2) as mathematical models to solve problems and interpret their solutions. The document outlines common types of problems in graph theory such as existence, construction, enumeration, and optimization problems. It provides some classic examples and concludes with a brief history of graph theory originating from Euler's Konigsberg bridges problem in 1735.

Uploaded by

Mark Arokiasamy
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 11

PRESENTATION

ON
GRAPH THEORY
Introduction

The development of graph theory is very


similar the development of probability theory,
where much of the original work was motivated
by efforts to understand games of chance. The
large portions of graph theory have been
motivated by the study of games and
recreational mathematics.
Generally speaking, we use graphs in
two situations. Firstly, since a graph is a very
convenient and natural way of representing the
relationships between objects we represent
objects by vertices and the relationship between
them by lines. In many situations (problems)
such a pictorial representation may be all that is
needed. Example of such applications are
chemical molecule and map coloring as shown
in the diagrams below. Other examples are
signal-flow graphs, Konigsberg bridges, tracing
maze etc
Secondly, we take the graph as mathematical model,
solve the appropriate graph-theoretic problem, and then
interpret the solution in terms of the original problem. This
modeling procedure can be illustrate as follows:

Most problems in graph theory can be described under the following headings:
Existence Problems
Does there exist . . . ?
Is it possible to . . . ?
Construction Problems
If . . . exists, how can we construct it?
Enumeration Problems
How many . . . are there, and can we list them all?
Optimization Problems?
If there are several . . . which one is the best?
For example, we may consider the following questions in
investigating the Konigsberg bridges problem.
Does there exist a closed trail crossing each of the seven
bridges exactly once? (existence problem).
If such a trail exists, how can we construct one? (constructive
problem).
How many closed trails are there, and can we list them?
(enumerate problem).
Which close trails involve shortest path. (Optimization
problems).
 
Existence Problems
Many of the existence problems in graph theory arose a recreational puzzles.
The Konigsberg Problem
Does there exist a closed trail crossing each of the seven bridges exactly
once?
The Knight's-Tour Problem
Does there exists a sequence of knight's moves visiting each square of a
chessboard exactly once and returning to the starting position?
The Four-Color Problem
Does exist a map which require four colors to color it, so that neighboring
countries are differently colored?
The Utilities Problem
Does there exist a way of connecting the three neighbors to the three utilities
in such a way that no two connections cross?
The Queen's Problem
Does there exist an arrangement of five queens on a chessboard so that
every non-occupied square is attached?
History
History of of Graph
Graph Theory
Theory

The origin of graph theory can be traced back to Euler's work on the
Konigsberg bridges problem (1735), which subsequently led to the
concept of an Eulerian graph. The study of cycles on polyhedra by
the Thomas P. Kirkman (1806 - 95) and William R. Hamilton (1805-
65) led to the concept of a Hamiltonian graph.
The concept of a tree, a  connected graph without cycles, appeared
implicitly in the work of Gustav Kirchhoff (1824-87), who employed
graph-theoretical ideas in the calculation of currents in electrical
networks or circuits. Later, Arthur Cayley (1821-95), James J.
Sylvester(1806-97), George Polya(1887-1985), and others use 'tree'
to enumerate chemical molecules.
The study of planar graphs originated in two recreational problems
involving the complete graph K5 and the complete bipartite graph
K3,3. These graphs proved to be planarity, as was subsequently
demonstrated by Kuratowski. First problem was presented by A. F.
Mobius around the year 1840 as follows
Once upon a time, there was a king with five sons.
In his will  he stated  that  after  his  death the sons
should  divide  the  kingdom into  five provinces so
that  the  boundary  of  each  province should have
a  frontiers  line  in  common with each of the other
four provinces.
Here the problem  is whether one can draw five mutually
neighboring regions in the plane.
The king further stated that all five brothers should
join  the provincial capital by roads so that no two
roads intersect.
Here the problem is that deciding whether the graph K5 is
planar.
The origin of second problem is unknown but it
is first mentioned by H. Dudeney in 1913 in its
present form.
The puzzle is to lay a water, gas, and electricity

to  each  of  the  three  houses without any pipe

crossing another.
This problem is that of deciding whether the
graph K3,3 is planar

You might also like