Every node u adjacent to v in G,graph is said to be complete - Data Structure

Q.  If every node ' u ' in ' G ' is adjacent to every other node ' v ' in ' G ', A graph is said to be ___________.
- Published on 26 Aug 15

a. isolated
b. complete
c. finite
d. strongly connected

ANSWER: complete

Related Content

 

    Discussion

  • Nirja Shah   -Posted on 21 Nov 15
    If there is a path between every pair of vertices, then this graph is called connected graph. In connected graph, there exist at least one path between every pair of its vertices.

➨ Post your comment / Share knowledge


Enter the code shown above:

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