Question

For a given graph G having v vertices and e edges which is connected
and has no cycles, which of the following statements is true?
1 v+1=e
2 v= e+1
v=e​

Answer 1

Answer:

solve him self

Explanation:

Answer: a

Explanation: In a walk if the vertices are distinct it is called a path, whereas if the edges are distinct it is called a trail.