Definition A graph in which any two distinct points are

Last updated: 10/3/2023

Definition A graph in which any two distinct points are adjacent is called a complete graph A complete graph with p vertices is denoted by K K K K K Fig 1 8 Note The number of edges of a complete graph K is p C 2 Ks 5 NULL GRAPH Definition A graph G whose edge set is empty is called a null graph or a totally disconnected graph