Question

A tree has 10 edges. How many vertices does the tree has?​

Answer 1

Step-by-step explanation:

A labelled tree with 6 vertices and 5 edges. In a graph theory a tree is an undirected graph in which a y two vertices are connected by exactly one path or equivalently a connected acyclic undirected graph

Answer 2

Answer:

The tree has 11 vertices.

Step-by-step explanation:

A tree is connected acyclic graph.

They have given that a tree has 10 edges

Therefore E = 10 (E = edges)

The relationship between the number of  edges of a tree to the number of vertices in a tree is given by  

E = V - 1 (V = vertices)

10 = V - 1

V = 11

Therefore the tree has a 11 vertices.