GRAPH THEORY

CREATED BY : RITIN BEHL

Defining some terms

Graph(G): Is a collection of vertices(V) and edges(E)

G=(V,E). An Edge having same vertex as start and end point are called as Self Loop .

Application of Graphs
In Engineering , physical , biological sciences few

examples are:a )Linked structure of website. b)

Useful in linguistics.

c) Study molecules in Chemistry and Physics. Some of problems solved by graph are:i)Konigsberg Bridge Problem ii)Utilities Problem iii) Electrical Network Problem

Different Types of Graph

Undirected Graph : Is one in which edges have no

orientation.
Directed Graph: Is an ordered pair D = (V, E) with

a) V a set whose elements are called vertices or nodes. b) E a set of ordered pairs of vertices, called arcs, directed edges, or arrow.

Continued..

Weighted Graph: If a number (weight) is assigned

to each edge.

Regular Graph: Is a graph where each vertex has

the same number of neighbors.

Continued..

Finite Graph: Is a graph G = (V, E) such that V and

E are finite sets.

Infinite Graph: is one with an infinite set of

vertices or edges or both. Null Graph: A Graph without any edges , is called Null Graph.

Properties of Graph
Two edges of a graph are called adjacent

(coincident) if they share a common vertex. Two vertices are called adjacent if they are the end vertices of the same edge. An edge and a vertex on that edge are called incident. The number of edges incident on vertices , with self loop counted twice is called Degree.

Isolated and Pendant Vertex

A vertex having no incident edge is called an Isolated

vertex.

A vertex of degree one is called Pendant vertex or an

End vertex.

Graph Theory - History

Leonhard Euler's paper on Seven Bridges of Knigsberg , published in 1736.

Famous problems
The traveling salesman problem

A traveling salesman is to visit a number of cities; how to plan the trip so every city is visited once and just once and the whole trip is as short as possible ?

Famous problems
In 1852 Francis Guthrie posed the four color problem which asks if it is possible to color, using only four colors, any map of countries in such a way as to prevent two bordering countries from having the same color. This problem, which was only solved a century later in 1976 by Kenneth Appel and Wolfgang Haken, can be considered the birth of graph theory.

Examples
Cost of wiring electronic components

Shortest route between two cities.

Shortest distance between all pairs of cities in a road

atlas. Matching / Resource Allocation Task scheduling Visibility / Coverage

Examples
Flow of material liquid flowing through pipes current through electrical networks information through communication networks parts through an assembly line In Operating systems to model resource handling

(deadlock problems) In compilers for parsing and optimizing the code.

History of Graph Theory

Questions