Answer Happy

Question 10 1 Which of the following statements describes a complete graph? O All pairs of distinct edges are incident, and it is called a kn graph in which n cquals the number of edges. All pairs of distinct edges are adjacent, and it is called a Kn graph in which n cquals the number of edges. All pairs of distinct vertices are adjacent, and it is called a Kn graph in which n equals the number of vertices. All pairs of distinct vertices are incident, and it is called a kn graph in which n cquals the number of vertices. a