please no hand writing please no hand writing Ev v deg v is

please no hand writing please no hand writing

E_v v deg^+ (v) is equal to to 6 7 5 2 The longest path of a tree is called Vertex Edges Radius diameter A sub graph of a graph G that contains every vertex of G and is a tree is called Trivial tree empty tree Spanning tree Full bianary tree

Solution

Answer :

5. The diameter of a tree (sometimes called the width) is the number of nodes on the longest path between two leaves in the tree.

6. A subgraph of a graph G that contains every vertex of G and a tree is called Spanning tree.