Question

which of the following statement is false?
a) G is connected and is Circuitless
b) G is connected and has no edges
c) G is minimally connected graph
d) G is Circuitless and has n-1 edges​

Answer 1

Answer:

Step-by-step explanation:

a>G is connected and is Circuitless can Connected can happen.

c>G is minimally connected graph -True ()

d>G is Circuitless and has n-1 edges - True (As it will form spanning tree)

Answer is (B) , As it contradict itself that G is connected graph with no edges it is not possible in Graphs.