1.

A graph is said to be ....... if every node u in G is adjacent to every other node v in G.

A. Absolute
B. Entire
C. Inclusive
D. Complete
Answer» E.


Discussion

No Comment Found