Scribd
Upload
2 views

Tree1_E11

The document discusses the concepts of trees in graph theory, defining a tree as a connected undirected graph without simple circuits. It outlines properties of trees, such as the unique path between vertices and the relationship between the number of vertices and edges. Additionally, it introduces rooted trees and their terminology, providing examples and exercises for better understanding.

Uploaded by

dfanish18
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
2 views

Tree1_E11

The document discusses the concepts of trees in graph theory, defining a tree as a connected undirected graph without simple circuits. It outlines properties of trees, such as the unique path between vertices and the relationship between the number of vertices and edges. Additionally, it introduces rooted trees and their terminology, providing examples and exercises for better understanding.

Uploaded by

dfanish18
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

Discrete Mathematics and Graph Theory

Module IV
Trees, Fundamental circuits and Cut sets
Trees, Properties of Trees, Distance and Centers in Tree, Rooted and Binary Trees, Spanning Tree, Spanning
Trees in a Weighted Graph. Cut Sets, Properties of Cut Set, Fundamental Circuits and Cut Sets
_____________________________________________________
Trees, Properties of Trees, Rooted Tree

Definition 1. (Tree)
A tree is a connected undirected graph with no simple circuit.
A graph, in which each connected component is a tree, is called a forest.
A vertex of degree one in a tree is called a leaf, or a terminal vertex.
A vertex of degree greater than one in a tree is called an interior vertex.
 Because a tree cannot have a simple circuit, a tree cannot contain multiple edges or
loops. Therefore any tree must be a simple graph.

Example 1. Trees with five or fewer vertices.

Example 2. Example of a Forest


Some Properties of Trees

Property 1. An undirected graph is a tree if and only if there is a unique simple path between
any two of its vertices.

Proof. (⇒) Let the undirected graph T be a tree.


Then, by definition of tree, T is a connected.
Hence there is a simple path between any pair of vertices, say 𝑣𝑖 and 𝑣𝑗 .
If possible, let there be two paths between 𝑣𝑖 and 𝑣𝑗 -- one from 𝑣𝑖 and 𝑣𝑗 , and the
other from 𝑣𝑗 and 𝑣𝑖 .
Combination (union) of these two paths would contain a circuit. But 𝑇 cannot have a
circuit, by definition. So two paths are not possible between 𝑣𝑖 and 𝑣𝑗 .
Hence, there is a unique simple path between any two vertices of in 𝑇.

(⇐) Let a unique simple path exists between any two vertices of in the graph 𝑇.
Then, graph 𝑇 is connected.
If possible, let 𝑇 contains a circuit. That means there is a pair of vertices 𝑣𝑖 and 𝑣𝑗
between which two distinct path exist, which is against the data.
Hence, graph 𝑇 cannot have a circuit, and so 𝑇 is a tree. ∎

Property 2. A tree with 𝑛 vertices has (𝑛 − 1) edges.

Proof. The property is true for 𝑛 = 1, 2, 3 as seen from the figure below:

Let us now use mathematical induction to prove the property completely. Accordingly, let the
property be true for all trees with less than 𝑛 vertices.
Let us consider a tree 𝑇 with 𝑛 vertices. Let 𝑒𝑘 be the edge connecting the vertices 𝑣𝑖 and 𝑣𝑗 .
Then, by property (1), 𝑒𝑘 is the only path between 𝑣𝑖 and 𝑣𝑗 .
If we delete the edge 𝑒𝑘 from 𝑇, then 𝑇 becomes disconnected and (𝑇 − 𝑒𝑘 ) consists of exactly
two components, say 𝑇1 and 𝑇2 which are connected.
Since T did not contain any circuit, 𝑇1 and 𝑇2 also would not have circuits.
So, both 𝑇1 and 𝑇2 are trees, each one having less than 𝑛 vertices, say 𝑟 and (𝑛 − 𝑟) respectively.
∴ By induction assumption, 𝑇1 has (𝑟 − 1) edges, and 𝑇2 has (𝑛 − 𝑟 − 1) edges.
⇒ Number of edges in tree T
= Number of edges in 𝑇1 + Number of edges in 𝑇2 + Nubmer of deleted edges
= (𝑟 − 1) + (𝑛 − 𝑟 − 1) + 1
=𝑛−1
Hence, a tree with 𝑛 vertices has (𝑛 − 1) edges. ∎

Property 3. Any connected graph with 𝑛 vertices and (𝑛 − 1) edges is a tree.

Proof. (The Proof is Left as an Exercise for the Students)

Property 4. Any circuitless graph with 𝑛 vertices and (𝑛 − 1) edges is a tree.


Proof. (The Proof is Left as an Exercise for the Students)

Definition 2. (Rooted Tree)


A rooted tree is a tree in which one vertex is designated as the root, and every edge is
directed away from the root. Usually the rooted tree is drawn with the root at the top.
Examples of rooted trees are presented below:
Terminology for rooted tree draws on the analogy with genealogy.
 For any directed edge (v, w), the vertex v is the parent of w, and w, is the child of v. If v
and w are any two vertices in a rooted tree for which there is a directed path from v to w,
then the vertex v is an ancestor of w, and w is a descendant of v. Vertices with the same
parent are siblings.
 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 its descendants and all edges incident to these descendants.
 The length of the path from the root of a rooted tree to any vertex 𝑣 is called the
𝑙𝑒𝑣𝑒𝑙 𝑜𝑟 𝑑𝑒𝑝𝑡ℎ 𝑜𝑓 𝑣 𝑜𝑟 ℎ𝑒𝑖𝑔ℎ𝑡 𝑜𝑓 𝑣.
 The root is said to be at zero level. The maximum level of any vertex is called the
𝑑𝑒𝑝𝑡ℎ 𝑜𝑟 ℎ𝑒𝑖𝑔ℎ𝑡 𝑜𝑓 𝑡ℎ𝑒 𝑡𝑟𝑒𝑒.

The following Figure shows examples of these notions.

Figure: Relationships between vertices.


Example 3. In the rooted tree T (with root a) shown below, find the parent of c, the children of
g, the siblings of h, all ancestors of e, all descendants of b, all internal vertices, and all leaves.
What is the subtree rooted at g?

Figure: A Rooted Tree T

Solution.
The parent of c is b. The children of g are h, i, and j . The siblings of h are i and j . The ancestors
of e are c, b, and a. The descendants of b are c, d, and e. The internal vertices are a, b, c, g, h, and
j . The leaves are d, e, f , i, k, l, and m. The subtree rooted at g is shown below.

Figure: Subtree Rooted at g

Example 4. Representing Organizations


The structure of a large organization can be modeled using a rooted tree. Each vertex in
this tree represents a position in the organization. An edge from one vertex to another
indicates that the person represented by the initial vertex is the (direct) boss of the person
represented by the terminal vertex. The graph shown in the following Figure displays such
a tree. In the organization represented by this tree, the Director of Hardware Development
works directly for the Vice President of R&D.

Figure: An Organizational Tree for a Computer Company.

Exercise Questions for Regular Practice (For Students)

1. Which of these graphs are trees?

2. Show that a simple graph is a tree if and only if it is connected but the deletion of any of
its edges produces a graph that is not connected.

3. Let G be a simple graph with n vertices. Show that G is a tree if and only if it is connected
and has (n – 1) edges.

4. Let G be a simple graph with n vertices. Show that G is a tree if and only if G has no simple
circuits and has (n – 1) edges.
5. Answer these questions about the rooted tree illustrated.

a) Which vertex is the root?


b) Which vertices are internal?
c) Which vertices are leaves?
d) Which vertices are children of j?
e) Which vertex is the parent of h?
f ) Which vertices are siblings of o?
g) Which vertices are ancestors of m?
h) Which vertices are descendants of b?

***

You might also like