Question:-
83. The max number of edge disjoint cut sets in a simple graph with n nodes is:
Option (A)
n
Option (B)
Option(C)
2n
Option(D)
n-1
Correct Option:
()
question-answer-faq-2482