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

  1. Home

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

1.isolated

2.complete

3.finite

4.strongly connected

Posted by R4R Team
  1. . If every node u in G is adjacent to every other node v in G, A graph is said to be
Search
R4R Team
R4Rin Top Tutorials are Core Java,Hibernate ,Spring,Sturts.The content on R4R.in website is done by expert team not only with the help of books but along with the strong professional knowledge in all context like coding,designing, marketing,etc!