Scribd
Upload
8 views

Discrete Module 4-1

Uploaded by

anant2003krishna
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
8 views

Discrete Module 4-1

Uploaded by

anant2003krishna
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 13

Module 4

TREE
• Definition − A Tree is a connected acyclic undirected graph. There is a
unique path between every pair of vertices in G. A tree with N number
of vertices contains (N-1) number of edges. The vertex which is of 0
degree is called root of the tree. The vertex which is of 1 degree is
called leaf node of the tree and the degree of an internal node is at
least 2
Theorems
Rooted Tree

You might also like