+1 vote
in Data Structures & Algorithms I by (88.2k points)
Which of the following properties does a simple graph not hold?

(a) Must be connected

(b) Must be unweighted

(c) Must have no loops or multiple edges

(d) Must have no multiple edges

My question is based upon Graph topic in portion Graph of Data Structures & Algorithms I

I got this question in homework.

1 Answer

+1 vote
by (672k points)
selected by
Best answer
Right choice is (a) Must be connected

The best explanation: A simple graph maybe connected or disconnected.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.