12.1 Definition and terminologies 2. Complete graph In an undirected graph with n nodes, the number of edges <=n*(n-1)/2.If=is satisfied then it is called a complete undirect graph12.1 Definition and terminologies 2.Complete graph In an undirected graph with n nodes, the number of edges <=n*(n-1)/2. If “=“ is satisfied, then it is called a complete undirect graph. V2 V4 V3 V1