A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

Discussion Forum

Que. Which of the following connected simple graph has exactly one spanning tree?
a. Complete graph
b. Hamiltonian graph
c. Euler graph
d. None of the above
Answer:None of the above
B :(October 25, 2019) Name of the connected simple graph which has exactly one spanning tree
Click to Add Comment

Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here

Similar Questions: