DISCRETE MATH TREE

GRAPH THEORIES
(INDIVIDUAL TASK)
PRE FINAL EXAM
 1. Tree Diagram

• The tree diagram

starts with one item
that branches into two
or more, each of
which branch into two
or more, and so on.
 2. Root
• If there is only one root
node or vertex in a
directed tree with an
incoming degree of 0, and
every other vertex has an
incoming degree of 1, the
directed tree is said to be
a rooted tree.
 3. Siblings
• In a rooted tree, two
nodes that are
connected to one
another and have the
same distance from the
root vertex are referred
to as siblings.
 4. Leaf

• If a tree vertex
has no children, it
is referred to as a
leaf.
 5. Branch
• The area of
mathematics known as
discrete mathematics
deals with mathematical
objects that can only take
on distinct, separated
values.
 6. Internal Node

• Internal nodes are

nodes with an outdegree
greater than or equal to
one.
 7. Degree

• Are the maximum and

minimum of its vertices'
degrees. In the multigraph
shown on the right, the
maximum degree is 5 and
the minimum degree is 0.
 8. Edge
• It is an edge which is
present in the tree
obtained after applying
DFS on the graph. All the
Green edges are tree
edges.
 9. Path

• In graph theory, a tree is

an undirected graph in
which any two vertices
are connected by exactly
one path, or equivalently
a connected acyclic
undirected graph.
 10. Level
• In the mathematical
subfield of graph theory a
level structure of an
undirected graph is a
partition of the vertices
into subsets that have the
same distance from a
given root vertex.
 11. Depth
• The tree-depth of a
graph is defined as the
tree-depth of its
simplification. Unlike tree-
depth, the branch-depth
of a graph may be
different from the branch-
depth of its simplification.
 12. Forest
• A forest is an undirected
graph in which any two
vertices are connected by at
most one path. Equivalently,
a forest is an undirected
acyclic graph, all of whose
connected components are
trees
 13. Height of Tree

• Height of the tree is

the number of edges in
the tree from the root
to the deepest node.
 14. Height of Node

• The height of a node is

the number of edges from
the node to the deepest
leaf.
THANKYOU!