# 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 **