

McqMate
Q. |
A graph is said to be complete if there is an edge between every pair of vertices. |
A. | true, true |
B. | false, true |
C. | false, false |
D. | true, false |
Answer» A. true, true |
View all MCQs in
Data Structure and Algorithms (DSA)No comments yet