If every node u in G is adjacent to every other node v in G, A graph is said to be

Options
- isolated
- complete
- finite
- strongly connected

CORRECT ANSWER : complete

Discussion Board
Data Structure - Graphs

If every node u in G is adjacent to every other node v in G, A graph is said to be complete.

Prajakta Pandit 02-1-2017 04:30 AM

Write your comments


Enter the code shown above:

(Note: If you cannot read the numbers in the above image, reload the page to generate a new one.)


Related Content

Advertisement
 
▲