GATE CSE
First time here? Checkout the FAQ!
x
+2 votes
195 views

Consider the following statements:

  1. A graph in which there is a unique path between every pair of vertices is a tree.
  2. A connected graph with e=v-1 is a tree
  3. A connected graph with e=v-1 that has no circuit is a tree

Which one of the above statements is/are true?

  1. I and III
  2. II and III
  3. I and II
  4. All of the above
asked in DS by Active (1.7k points)  
edited by | 195 views

1 Answer

+4 votes
Best answer

Lets go one by one,

(i) A graph in which there is a unique path between every pair of vertices is a tree.

==> This statement is true, Because graph can have unique path only when it does not have cycle. And according to the definition of tree, its a graph without cycel. Hence this is a valid statement.

(ii) A connected graph with e = v − 1 is a tree.

==> This statement is true. Not every graph with e = v - 1, will be a tree. But if the graph is connected hence its true. 

(iii) A graph with e = v − 1 that has no circuit is a tree.

==> This statement is also true, Here he has not mentioned the connected thing, but mentioned that it has no circuit. It means that its connected.

 

You can also proof these, just by taking some example. For the formal Proof check this

answered by Veteran (34.1k points)  
selected by
i need proof.
check now.
u r a savier sir thanks
What is meaning of circuit here ??

I know two types of circuit - A ) Hamilton circuit and B) Eulerian Circuits.

Circuit means cycle. and they are not two types of circuit. cheeky



Top Users Sep 2017
  1. Habibkhan

    6338 Points

  2. Warrior

    2220 Points

  3. Arjun

    2150 Points

  4. nikunj

    1980 Points

  5. manu00x

    1726 Points

  6. SiddharthMahapatra

    1718 Points

  7. Bikram

    1716 Points

  8. makhdoom ghaya

    1660 Points

  9. A_i_$_h

    1518 Points

  10. rishu_darkshadow

    1512 Points


25,981 questions
33,556 answers
79,367 comments
31,014 users