1.

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?

A. v=e
B. v = e+1
C. v + 1 = e
D. None of the mentioned
Answer» C. v + 1 = e


Discussion

No Comment Found