Scribd
Upload
41 views

Graph Theory and Combinatorics (CSL-363) (CSL-363) : Dr. Shruti Gupta

This document discusses concepts and terminology related to trees in graph theory and combinatorics. It defines a tree as a connected undirected graph with no cycles. It lists 5 key properties of trees: they are connected, have no cycles, have a unique simple path between any pair of vertices, have n-1 edges if they have n vertices, and are minimally connected graphs. It also defines common tree terminology like distance, eccentricity, diameter, and center.

Uploaded by

ddd
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
41 views

Graph Theory and Combinatorics (CSL-363) (CSL-363) : Dr. Shruti Gupta

This document discusses concepts and terminology related to trees in graph theory and combinatorics. It defines a tree as a connected undirected graph with no cycles. It lists 5 key properties of trees: they are connected, have no cycles, have a unique simple path between any pair of vertices, have n-1 edges if they have n vertices, and are minimally connected graphs. It also defines common tree terminology like distance, eccentricity, diameter, and center.

Uploaded by

ddd
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/ 11

GRAPH THEORY AND

COMBINATORICS
(CSL-363)
Dr. Shruti Gupta
Trees : Concepts and Basic

Terminologies
Tree
Definition: A connected undirected graph with no cycle

(a) (b) (c) (d) (e)

Trees with (a)One (b) Two (c) Three (d) Four (e) Five vertices
Properties of Tree
Property-I Tree is a connected graph

Property-II Tree has no cycle

Property-III There is one and only one path between every


pair of vertices in a tree

Property-IV A tree with n vertices has (n-1) edges

Property-V Tree is minimally connected graph


Properties of Tree
Property-I There is one and only one path between every
pair of vertices in a tree.
Proof (=>) The graph is a Tree and it does not have cycles. If
there were cycles then there will be more than one simple
path between two vertices. Hence, there is a unique simple
path between every pair of vertices

Conversely:
Property –II If in a graph there is one and only one path
between every pair of vertices than that graph is a tree.
Proof (<=) There exists a unique simple path between any pair
of vertices. Therefore the graph is connected and there are no
cycles in the graph. Hence, the graph is a tree.
Properties of Tree
Property-III : A tree with n vertices has n-1 edges
Proof: By induction

Basis Step: for n = 1 there are (1 – 1) 0 edges

Inductive Step: We assume that n vertices has n – 1


edges . We need to prove that n + 1 vertices have n edges.

A tree with n + 1 vertices can be achieved by adding an


edge from a vertex of the tree to the new vertex. The total
number of edges is (n – 1 + 1 = n).
Terminologies
Distance d(vi,vj): It is defined as the shortest path between the
two vertices vi and vj.
Terminologies
Eccentricity: The maximum distance between a vertex to all
other vertices is considered as the eccentricity of the vertex. It is
denoted by e(V).
E(a)=2 E(b)=1 E(c)=2 E(d)=2

e(v)=max d(v, vi)


Terminologies
Diameter: The diameter of a tree is
defined as the length of the longest
path
Terminologies
Center: The center of G is the set of vertices having minimum
eccentricity.

Radius: Eccentricity of the center is defined as the radius of the


tree.
Exercise

You might also like