Gate Exam

What is the minimum possible weight of a spanning tree T in this graph such that
vertex 0 is a leaf node in the tree T?

Read Solution (Total 0)

Gate Other Question

Suppose the predicate F(x, y, t) is used to represent the statement that person x can fool person y at time t. which one of the statements below expresses best the meaning of the formula "x y t(F (x, y, t))?
option
(A) Everyone can fool some person at some time
(B) No one can fool everyone all the time
(C) Everyone cannot fool some person all the time
(D) No one can fool some person at some time What is the minimum possible weight of a path P from vertex 1 to vertex 2 in this
graph such that P contains at most 3 edges?