Which statement is FALSE related to undirected graphs :


  1. An undirected graph is connected if, for every pair of nodes u and v, there is a path from u to v.
  2. In an undirected graph a path is simple if all nodes are not
  3. In an undirected graph a cycle is a path v1, v2,, vk-1, vk in which v1 = vk, k > 2, and the first k-1 nodes are all distinct
  4. An undirected graph is a tree if it is connected and does not contain a cycle


Anurag Mishra Professor Asked on 13th January 2016 in Computers.
Add Comment
  • 0 Answer(s)

    Your Answer

    By posting your answer, you agree to the privacy policy and terms of service.