University Of SALAHADDIN – Erbil

College Of ENGINEERING
SOFTWARE & INFORMATICS Dep.

T R E ED I S C R E T E M AT H E M AT I C S

Prepared: Supervised:
BAWER A. Haji SALAR Atrooshi
 CONTENTS
Introduction

Tree & Binary Tree

M-ARY & Ordered Rooted Tree

Properties of Tree

Tree Traversal

Spanning Tree

Bibliography
 INTRODUCTION
Tree is an undirected graph in which any two vertices are connected by

exactly one path.

The term “TREE” was coined in 1857.

By the British Mathematician “ARTHUR CAYLEY”.

Any ACYCLIC connected graph is a TREE.

Various kinds of data structures referred to as TREES.

 TREE
Is a connected undirected graph with no simple circuits.

SIMPLE CIRCUIT is any graph that contains multiple edges or loops.

A not connected graph without simple circuits is called a FOREST.

THEOREM:

 Any undirected graph is a TREE iff there is a unique simple path

between any two vertices.

 Any connected graph that contains no simple circuits is a tree.

 T R E E (C O N T.)
Example: Which of the Graphs are TREEs?

G1 and G2 are TREEs

G3 is not a TREE because (e, b, a, d, e) is a simple circuit in this graph.

G4 is not a TREE because it is not connected.

 ROOTED TREE
Is a Tree in which one vertex has been designated as the root and every

edge is directed away from the root.

Component Names:

Parent, Child, Siblings, Ancestors, Descendant, Leaf, Internal Vertices.

 SUBTREE
If (A) is a vertex in a Tree, the subtree with (A) as its root is the

SubGraph of the Tree consisting of (A) and it's DESCENDANTS and

all edges incident to these Descendants

TREE

SUBTREE WITH (C)

 M –ARY & B I NARY TR E E
Rooted tree is called an M-ARY tree if every internal vertex has no

more than (M) children.

 The Tree is called a FULL M-ARY tree if every internal vertex has

exactly (M) children.

 The Tree is called a BINARY tree if every internal vertex has

exactly (2) children

 M – A R Y & B I N A R Y T R E E (C O N T.)

T1 is a full binary tree, each of its internal vertices has two children.

T2 is a full 3-ary tree & T3 is a full 5-ary tree.

T4 is not a full m-ary tree for any m because some of its internal

vertices have two children and others have three children.

 ORDERED ROOTED TREE
Is a Rooted Tree where the children of each int.vertex are ordered.

The children of each int.vertex are shown in order from left to right.

If an internal vertex has two children:

First child is called the left child .

Second child is called the right child.

 CENTER OF A TREE
Is the vertex or the edge found by the following recursive Ways:

If T is a single vertex or a single edge, then this (T) is the center.

Else, we create a smaller tree (T′ ⊂ T) by removing all leaves of (T) at

the same time.

This (T′) is nonempty.

The center of T is identical to this center of (T′).

 PROPERTIES OF TREE
We need some Results relating the numbers of edges or vertices.

For This Purpose we should use this Rule or Theorems.

THEOREM 1:

 A tree with (X) vertices has (X – 1) edges.

Example, if We have a tree with one Vertex , by using that Rule we will

find that our tree has no edges.

 P R O P E R T I E S O F T R E E (C O N T.)
THEOREM 2:

 A full M-Ary tree with ( Z ) internal vertices contains (N = M Z + 1)

vertices.

 Example: if we have this full 3-Ary tree.

we will find:

I=4 N = (3) (4) + 1 = 13

 P R O P E R T I E S O F T R E E (C O N T.)

THEOREM 3:

 A full M-Ary tree with:

 N vertices has {I = (N − 1)/M} internal vertices and {L = [(m − 1)n + 1]/m} leaves.

 I internal vertices has {N = MI + 1} vertices and {L = (M − 1) I + 1} leaves.

 L leaves has {N = (ML − 1) / (M − 1)} vertices and {I = (L − 1) / (M – 1)} i.v.

 T R E E T RAV E R SAL
Ordered rooted trees are used to store information.

Actually we need procedures for visiting each vertex to access data.

Trees can also be used to represent various types of expressions.

Types are:

 Universal Address System

 Preorder, In order, Post order Traversal

 S PA N N I N G T R E E
Spanning Tree (T) of an undirected graph (G) is actually a subgraph of

(G) that is a tree which includes all of the vertices with minimum

possible number of edges.

A graph may have several Spanning Trees.

A graph that is not connected might have Spanning Forest.

A simple graph with a SPANNING TREE must be connected.

 S PA N N I N G T R E E
Example: Spanning Trees of the simple graph G is:

Minimum Spanning Tree:

 A Spanning Tree in which the sum of edge weights is minimum.

 CONCLUSION
TREE deals with the study of problems involving discrete arrangements
objects, where concern is not with the internal properties of the objects
but the relationship among them.
In this thesis we have studied the Trees and Properties of it.
The idea of this thesis was to find out and Discussing the Tree, Types
and some important properties of them.
Thanks!
Rosen, K. and Krithivasan, K. :

BIBLIOGRAPHY
Discrete mathematics and its applications "7th Edition".
Chih-Wei Yi. :
Discrete Mathematics (2009 Spring).
Kousha Etessami. University of Edinburgh, UK:
Discrete Mathematics & Mathematical Reasoning.
H. Turgut Uyar, Aysegul Gencata & Emre Harmancı (2007):
Discrete Mathematics and Applications.
Petr Hliněný:
Trees and Forests. (2010). In: FI MU Discrete Mathematics.
Haggard, G., Schlipf, J. and Whitesides, S. (2006):
Discrete mathematics for computer science.
Matoušek, J. and Nešetřil, J. (2011):
Invitation to discrete mathematics.
Lipschutz, S. and Lipson, M. (2011):
Schaum's outline of discrete mathematics.