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

• A. isolated
• B. complete
• C. finite
• D. strongly connected