A new approach to complete graph

Abstract

A graph consists of a nonempty vertex set and an edge set, denoted G=(V, E). An unordered pair of edge v,w is known as an undirected edge and an ordered pair of edge (v, w) is known as a directed edge. A graph with directed edges is called a directed graph, simply a digraph; otherwise an undirected graph. Usually, an undirected graph is simply known as a graph. This paper gives a new approach to complete graph and investigates some results related to this idea.