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.