<Tr> <Th> Notation </Th> <Td> </Td> </Tr> <P> In the mathematical field of graph theory, a complete graph is a simple undirected graph in which every pair of distinct vertices is connected by a unique edge . A complete digraph is a directed graph in which every pair of distinct vertices is connected by a pair of unique edges (one in each direction). </P> <P> Graph theory itself is typically dated as beginning with Leonhard Euler's 1736 work on the Seven Bridges of Königsberg . However, drawings of complete graphs, with their vertices placed on the points of a regular polygon, appeared already in the 13th century, in the work of Ramon Llull . Such a drawing is sometimes referred to as a mystic rose . </P> <P> The complete graph on n vertices is denoted by K. Some sources claim that the letter K in this notation stands for the German word komplett, but the German name for a complete graph, vollständiger Graph, does not contain the letter K, and other sources state that the notation honors the contributions of Kazimierz Kuratowski to graph theory . </P>

Draw a complete undirected graph having 5 nodes