T R E E

Discrete Mathematics
Team members
Sr.No. Name Roll No.
1. Prathamesh Kambli 45
2. Gaurav Kamble 46
3. Keval Kamble 47
4. Hardik Kangane 49
5. Nishant Kasbekar 50
 INTRODUCTION
Mathematically speaking TREES are a special class of a graph.

The relationship of a trees to a graph is very importat in solving

many problems in mathematics.

Definition :- A TREE is a connected graph without

any circuit.
A graph is called a tree if, and only if
it is circuit free and connected.
Example of non TREES :-
(1) (2)

Contain a circuit Not connected

or loop. graph
Some important properties of TREES.
1. A graph G is a tree if and only if there is a unique
simple path between any two vertices of G.

2. Every tree ,T=(V,E) with |V|≥2, has at least two

vertices that have degree=1.

3. Every tree with 'n ' vertices has exactly (n-1) edges.
Ex.
n=5
e = (5-1) = 4
 CATEGORY'S OF TREES
◾ weighted Graph
A graph G is said to be a weighted Graph if all
the edges of a graph G is assigned a non negative
real numbers.
Ex.

◾ weighted Tree
A tree T is said to be a weighted Tree if
all the edges of a T is assigned a non negat-
ive real numbers.
 Rooted tree
A rooted tree is a tree in which there is one vertex that
is distinguish from the other and is called the root.
The level of a vertex is the number of along the unique
path between it and the root.

Root
Root

Level 1

Level 2
 Binary trees
A binary tree is a special class of
tree in which there is only one
vertex having degree 2 and all
other vertices have either
degree 1 or 3.
◾The vertex having degree 2
is ROOT VERTEX.
◾The vertex having degree
one is PENDANT VERTEX.
◾The vertex having degree 3
is INTERNAL VERTEX.
 Spanning tree
Let G be a simple graph a spanning tree of G is a
subgroup of G that is a tree containing every vertex of
G.
A simple graph with a spanning tree tree must be
connected because there is a path in the spanning
Tree between any two vertices.

Spanning tree Spanning tree

Find the spanning tree of the following graph ?

Solution : The graph G is connected, but it is not tree

because it contains simple cycle.
Remove the edge {a,e} the
eliminate one simple circuit
and the resulting subgraph
is still connected until
contain every vertex of G.
Next remove the edge {e,f} to
eliminate a second simple
circuit
Finally remove edge {c,g}
produce a simple graph with
no simple circuit this
subgraph is a spanning Tree
because it is a tree that
contains every vertex of tree
 Application of spanning tree

spanning tree is basically used to find a minimum

path to connected all nodes in a graph common
application of spanning trees are.

*Civil network planning

*Computer network routing protocol

*Cluster analysis
 Minimum spanning tree
A spanning of a graph having minimum weight is
called minimum spanning Tree.
A minimum spanning Tree in a connected weighted
Graph is a spanning tree that has the smallest possible
sum of weights of its edge.
There are two ways to find minimum spanning tree
(1) Prims Algorithm
Start with any vertices
randomly.
a,b 2
a,d 3
d,c 2
c,g 3
g,f 2
c,e 3
Total 15

Note if there are n vertices in a

graph then there are (n-1) edges
(2) Kruskal's Algorithm
Since the number of
edges= 9 -1
=8

AB 4
AH 8
HG 1
GF 2
CF 4
CI 2
CD 7
DE 9
Total 37
 Uses Of Trees In Information
Technology

1.Tree can be used in logic and decision making

like a programming flow charts.

2.They can also be used in probable and in

calculating route and path length in networks.

3.Trees are helpful tools in many branches of

discrete mathematics.
 REFERENCE
 Tech - Max publication (Discrete Mathematics)

 https://www.tutorialspoint.com/index.htm

 https://www.slideshare.net/mobile/AdilAslam
4/chapter-11-tree-in-discrete-mathematics