Which statement is FALSE related to undirected graphs :
- An undirected graph is connected if, for every pair of nodes u and v, there is a path from u to v.
- In an undirected graph a path is simple if all nodes are not
- 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
- An undirected graph is a tree if it is connected and does not contain a cycle