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