0% found this document useful (0 votes)
22 views27 pages

Fundamentals of Graph Theory

Uploaded by

sambtganguly20
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
0% found this document useful (0 votes)
22 views27 pages

Fundamentals of Graph Theory

Uploaded by

sambtganguly20
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/ 27

FUNDAMENTALS OF GRAPH THEORY GRAPH THEORY

APPLICATIONS OF GRAPH THEORY:


1. Königsberg Bridge Problem: The Königsberg bridge problem is perhaps the best-known example in graph theory. It was a
long-standing problem until solved by Leonhard Euler (1707-1783) in 1736, by means of a graph.
Two islands, C and D, formed by the Pregel River in Königsberg (then the capital of East Prussia but now renamed
Kaliningrad and in West Soviet Russia) were connected to each other and to the banks A and B with seven bridges, as shown
in Figure below. The problem was to start at any of the four land areas of the city, A, B, C, or D, walk over each of the seven
bridges exactly once, and return to the starting point (without swimming across the river, of course).

2. Utilities Problem: There are three houses H1, H2, and H3, each to be connected to each of the three utilities—water (W),
gas (G), and electricity (E)— by means of conduits. Is it possible to make such connections without any crossovers of the
conduits?
3. Seating Problem: Nine members of a new club meet each day for lunch at a round table. They decide to sit such that
every member has different neighbours at each lunch. How many days can this arrangement last?

SUBSCRIBE tendingtoinfinityofficial
FUNDAMENTALS OF GRAPH THEORY GRAPH THEORY
APPLICATIONS OF GRAPH THEORY:

SUBSCRIBE tendingtoinfinityofficial
FUNDAMENTALS OF GRAPH THEORY GRAPH THEORY
GRAPH:
A Graph G is a mathematical structure consisting of two sets V and E where V is non empty set of vertices and E is non
empty set of edges. i.e. Graph: <V,E>

Example:

Terminologies:
1. Trivial graph: A Graph Consisting only one vertex and no edges.
Example:

2. Null graph: Graph Consisting of n vertices but no edge.


Ex:

SUBSCRIBE tendingtoinfinityofficial
INTRODUCTION TO GRAPH THEORY GRAPH THEORY
3. Directed Graph: Graph Consisting of edges with direction.

4. Undirected Graph: Edges in graph are without direction.

5. Self Loop in Graph: An edge whose two end vertices are same is called a self loop or Loop.

6. Proper Edge: An edge which is not a self loop:

SUBSCRIBE tendingtoinfinityofficial
INTRODUCTION TO GRAPH THEORY GRAPH THEORY
7. Parallel Edges/Multi edge: There may exist more than one edge associated with a given pair of vertices. Such edges are
called parallel edges or parallels or multi edges.

8. Simple Graph: A graph having no parallel edges and no self loops is called simple graph.

9. Multi Graph: A graph having having parallel(Multi) edges but no self loops is called multi graph.

10. Pseudo Graph: A graph having parallel edges and self loops is called pseudo graph.

SUBSCRIBE tendingtoinfinityofficial
INTRODUCTION TO GRAPH THEORY GRAPH THEORY
11. Incidence: When a vertex is an end vertex of an edge then the vertex and the edge are called incident to each other

12. Adjacency : Two vertices are said to be adjacent if they are end vertices of the same edge.

13. Degree of Vertex: The number of edges incident to a vertex, with self-loops counted twice, is called degree of the
vertex. It is denoted by deg(ui).

SUBSCRIBE tendingtoinfinityofficial
INTRODUCTION TO GRAPH THEORY GRAPH THEORY
14. Isolated Vertex: There may exist some vertex which are not connected by any lines. A vertex having no incident edge is
called an isolated vertex.
Note: The degree of an isolated vertex is 0.

15. Pendant Vertex and Pendant Edge (or, End Vertex) : A vertex whose degree is 1 is called pendant vertex. An edge
incident to a pendant vertex is called a pendant edge.

16. Finite and Infinite Graphs:

SUBSCRIBE tendingtoinfinityofficial
INTRODUCTION TO GRAPH THEORY GRAPH THEORY
17. Order of Graph: Number of vertices in a graph is called the order of graph. It is denoted by o(G).

18. Size of graph: Number of edges in a graph is called the size of graph. It is denoted by size(G).

SUBSCRIBE tendingtoinfinityofficial
INTRODUCTION TO GRAPH THEORY GRAPH THEORY
Types of graphs:
1. Regular Graph: A graph G(V,E) in which all vertices are of equal degree is called a regular graph. If degree of every
vertex is “K” then we call it K-regular graph.

2. Complete Graph (Kn) : A simple connected graph G(V,E) is called a complete graph if each vertices is connected to
every other vertex. A complete graph with n vertices is denoted by Kn

Note: A complete graph is always a regular graph.

SUBSCRIBE tendingtoinfinityofficial
INTRODUCTION TO GRAPH THEORY GRAPH THEORY
3. Connected Graph: A Graph G(V, E) is said to be connected if there be a path for each pair of vertices either directly
connected or through some intermediate vertices. otherwise it is called Disconnected.
Component: We noted that a disconnected graph is formed by two or more connected graph. Each of these connected sub
graph is called a component of the graph.

Note: Every Complete graph is a connected graph but Converse is not true.

4. Bipartite Graph: A simple Graph G is called a bipartite graph if the vertex set V of G can be partitioned into two non
empty disjoint subsets X and Y such that each edge of G has one end in X and the other end in Y.
2023

SUBSCRIBE tendingtoinfinityofficial
INTRODUCTION TO GRAPH THEORY GRAPH THEORY

5. Complete Bipartite Graph : A bipartite graph G with the two partitioned vertex set X and Y is called complete bipartite
graph if every vertex of X is joined to every vertex of Y. If X contains m number of vertices and Y contains n number of
vertices them the complete bi-graph is denoted by “Km,n”.
A . Km,n complete Bi-graph has “𝑚𝑛” edges.

Note: Complete Bipartite = Complete + Bipartite.

SUBSCRIBE tendingtoinfinityofficial
INTRODUCTION TO GRAPH THEORY GRAPH THEORY

6. Subgraph and Super graph : Let G(V, E) be a graph with vertex set V and edge set E. Let V’ be Subset of V and E’ be
subset of E whose end points belongs to V’ then G(V’,E’) is a graph and called subgraph of G(V,E).

SUBSCRIBE tendingtoinfinityofficial
INTRODUCTION TO GRAPH THEORY GRAPH THEORY
7. Decomposition of Graph: A graph G is said to be decomposed into 2 subgraphs G1 & G2 if 𝐺1𝑈𝐺2 = 𝐺 & 𝐺1 ∩ 𝐺2 = 𝜙

8. Vertex Disjoint and Edge-disjoint Graph: Two graphs are called vertex disjoint if they have no vertex in common. Two
graphs are called edge-disjoint if they have no edge in common.

SUBSCRIBE tendingtoinfinityofficial
INTRODUCTION TO GRAPH THEORY GRAPH THEORY
9. Complement of a Graph: Let G be a simple graph. Another graph say 𝐺̅ is said to be complement of G if 𝐺̅ has same
vertex set as G and two vertices in 𝐺̅ would be adjacent if they are not adjacent in G.

10. Deletion of a vertex from a graph: Let G be a graph and v be vertex of it. The subgraph of G obtained by deleting y
and the edges incident on v is known as the graph obtained b y deletion of v. It is denoted by G-v

SUBSCRIBE tendingtoinfinityofficial
INTRODUCTION TO GRAPH THEORY GRAPH THEORY
11. Planar Graph: A graph which can be drawn in the plane so that its edges do not cross is called Planar.

SUBSCRIBE tendingtoinfinityofficial
INTRODUCTION TO GRAPH THEORY GRAPH THEORY
11. Planar Graph: A graph which can be drawn in the plane so that its edges do not cross is called Planar.

12. Handshaking theorem: The sum of the degree of the vertices of a graph G is equal to twice the number of edges in G.
, deg 𝑣! = 2(𝑁𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑒𝑑𝑔𝑒𝑠)

SUBSCRIBE tendingtoinfinityofficial
INTRODUCTION TO GRAPH THEORY GRAPH THEORY
13. Fundamental Number of a Graph:
Let G be a graph. The number of vertices n, number of edges e and number of component k are called Fundamental Number
of G. These three numbers are independent.
Note:
(1) 𝑛 ≥ 𝑘
(2) 𝑒 ≥ 𝑛 − 𝑘
(3) 𝑛 − 𝑘 is called rank of G , 𝑒 − 𝑛 + 𝑘 𝑖𝑠 𝑐𝑎𝑙𝑙𝑒𝑑 𝑛𝑢𝑙𝑙𝑖𝑡𝑦 𝑜𝑓 𝐺

SUBSCRIBE tendingtoinfinityofficial
INTRODUCTION TO GRAPH THEORY GRAPH THEORY

SUBSCRIBE tendingtoinfinityofficial
INTRODUCTION TO GRAPH THEORY GRAPH THEORY

SUBSCRIBE tendingtoinfinityofficial
INTRODUCTION TO GRAPH THEORY GRAPH THEORY

SUBSCRIBE tendingtoinfinityofficial
INTRODUCTION TO GRAPH THEORY GRAPH THEORY

SUBSCRIBE tendingtoinfinityofficial
INTRODUCTION TO GRAPH THEORY GRAPH THEORY

SUBSCRIBE tendingtoinfinityofficial
INTRODUCTION TO GRAPH THEORY GRAPH THEORY

SUBSCRIBE tendingtoinfinityofficial
INTRODUCTION TO GRAPH THEORY GRAPH THEORY

SUBSCRIBE tendingtoinfinityofficial
INTRODUCTION TO GRAPH THEORY GRAPH THEORY

SUBSCRIBE tendingtoinfinityofficial
INTRODUCTION TO GRAPH THEORY GRAPH THEORY

SUBSCRIBE tendingtoinfinityofficial
INTRODUCTION TO GRAPH THEORY GRAPH THEORY

SUBSCRIBE tendingtoinfinityofficial

You might also like