Scribd
Upload
24 views55 pages

Special Topic 1. Introduction To Graph Theory Copy - 1

Graph theory, introduced by Leonhard Euler in the 18th century through the Seven Bridges of Königsberg problem, studies relationships using nodes and connections. It encompasses various types of graphs, including directed, undirected, weighted, and complete graphs, and explores concepts such as vertex degree, isomorphism, and Euler cycles. The document also discusses representations of graphs through adjacency and incidence matrices.

Uploaded by

Kate Angel Juanillo Abad
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
24 views55 pages

Special Topic 1. Introduction To Graph Theory Copy - 1

Graph theory, introduced by Leonhard Euler in the 18th century through the Seven Bridges of Königsberg problem, studies relationships using nodes and connections. It encompasses various types of graphs, including directed, undirected, weighted, and complete graphs, and explores concepts such as vertex degree, isomorphism, and Euler cycles. The document also discusses representations of graphs through adjacency and incidence matrices.

Uploaded by

Kate Angel Juanillo Abad
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 55

An Introduction to Graph

Theory
The HISTORY of Graph Theory

The basic idea of graphs were first introduced in the 18th century
by the Swiss mathematician Leonhard Euler, one of the most
eminent mathematicians of the 18th century (and of all time,
really). His work on the famous “Seven Bridges of Königsberg
problem”, are commonly quoted as origin of graph theory.
Konigsberg is an ancient city of Prussia, now Kalingrad, Russia. The city was set on both sides of the Pregel River, which also had two
islands connected to each other with seven bridges. Two of the seven original bridges were destroyed during WWII, but the story which
follows has captured the imagination of mathematicians through present day. In the Middle Ages, Konigsberg was a very important city and
trading center with its location strategically positioned on the river. The seven bridges were called Blacksmith’s bridge, Connecting Bridge,
Green Bridge, Merchant’s Bridge, Wooden Bridge, High Bridge, and Honey Bridge. As the story goes, the citizens of Konigsberg used to
spend Sunday afternoons walking around their beautiful city. While walking, the people of the city decided to create a game for themselves,
their goal being to devise a way in which they could walk around the city, crossing each of the seven bridges only once. No one could figure
out a route that would allow them to cross each of the bridges only once.
Graph Theory is ultimately the study of relationships. Given a set
of nodes & connections, which can abstract anything from city
layouts to computer data, graph theory provides a helpful tool to
quantify & simplify the many moving parts of dynamic
systems. Studying graphs through a framework provides answers to
many arrangement, networking, optimization, matching and
operational problems.
INTRODUCTION

• What is a graph G?
It is a pair G = (V, E), where
V = V(G) = set of vertices
E = E(G) = set of edges
• Example:
V = {s, u, v, w, x, y, z}
E = {(x,s), (x,v)1, (x,v)2, (x,u), (v,w),
(s,v), (s,u), (s,w), (s,y), (w,y), (u,y), (u,z),(y,z)}
Directed graphs (digraphs)
G is a directed graph or digraph if each edge has been
associated with an ordered pair of vertices, i.e. each edge
has a direction
UNDIRECTED GRAPH
• Edges have no direction.
• If an edge connects vertices 1 and 2, either convention can be used:
No duplication: only one of (1, 2) or (2, 1) is allowed in E.
Edges
• An edge may be labeled by a pair of vertices, for
instance e = (v, w).
• e is said to be incident on v and w.
• Isolated vertex = a vertex without incident edges.
Special edges
• Parallel edges
– Two or more edges
joining a pair of vertices
in the example, a and b
are joined by two parallel
edges
• Loops
– An edge that starts
and ends at the same vertex
In the example, vertex d has a loop
Special graphs
• Simple graph
– A graph without loops
or parallel edges.
• Weighted graph
– A graph where each
edge is assigned a
numerical label
or “weight”.
Complete graph K n
• Let n > 3
• The complete graph Kn
is the graph with n vertices
and every pair of vertices
is joined by an edge.
• The figure represents K5
• The degree of complete graph is n-1
FINITE AND INFINITE GRAPH
• A graph G = (V, E ) is called a finite graph if the vertex Set V is
finite set.

• A graph G = ( V, E ) is called an infinite graph if the vertex Set V


is an infinite set.
DEGREE OF THE VERTEX
The degree of a
vertex v, denoted by (v),
is the number of edges
incident on v
• Example:
(a) = 4, (b) = 3,
(c) = 4, (d) = 6,
(e) = 4, (f) = 4,
(g) = 3.
DEFINITION
• A Regular graph is a graph in which each vertex has the
same degree
• K- Regular graph is a graph in which each vertex has
the same degree equal to k
for example
CONNECTED,DISCONNECTED GRAPHS AND
COMPONENT
EXAMPLES
Activity
Activity
Create a connected graph on the following:

1. The total number of edges are six.


2. Each pair of edges has exactly one vertex in common.
3. Each vertex has degree 2.
Create a connected graph on the following:

1. The total number of vertices is four.


2. Each pair of vertices is connected by an edge.
3. Each edge has a degree of three.
Activity
A.1. Each committee consists of exactly two people.
A.2. There are exactly six committees.
A.3. Each person serves on exactly three committees.
Isomorphic graphs
G1 and G2 are isomorphic
• if there exist one-to-one onto functions f : V(G1) → V(G2) and g :
E(G1) → E(G2) such that
• an edge e is adjacent to vertices v, w in G1 if and only if g(e) is
adjacent to f(v) and f(w) in G2
Isomorphic Graphs
• In other words ,two graphs which are
isomorphic will have
• Same number of vertices
• Same number of edges
• An equal number of vertices with given
degrees
Walks, Trail, Paths, and Cycles
Length of Walk
9
Euler graphs
An Euler cycle in a graph G is a simple cycle
that passes through every edge of G only once.

• A graph G is an Euler graph if it has an Euler


cycle.
G is an Euler graph if and only if G is
connected and all its vertices have even degree.
Planar graphs
• A graph (or multigraph) G is called planar if G can be drawn in
the plane with its edges intersecting only at vertices of G.
• Such a drawing of G is called an embedding of G in the plane.
Euler’s formula
If G is planar graph,
v = number of vertices
e = number of edges
f = number of faces, including
the exterior face
Then: v – e + f = 2
Representations of graphs

• Adjacency matrix
Rows and columns are labeled with ordered
vertices
write a 1 if there is an edge between the row
vertex and the column vertex
and 0 if no edge exists between them
EXAMPLE
Incidence matrix
• Incidence matrix
– Label rows with vertices
– Label columns with edges
– 1 if an edge is incident to a vertex, 0 otherwise
INCIDENCE GRAPH
Isomorphism and adjacency
matrices
Two graphs are isomorphic if and only if
after reordering the vertices their adjacency matrices are
the same
THE END

THANKS

You might also like