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. 

Keywords

• Graph,complete graph,regular graph

References

1. Berge, C., Theory of Graphs and its Applications, Methuen, London, 1962.
2. Bondy, J.A. and Murty, U.S.R. Graph Theory with Applications, North-Holland, Elsevier, 1981.
3. Chartrand, G., and Lesniak, L., Graphs And Digraphs, Chapman & Hall, 3 ^rd Edn., 1996.
4. Diestel, R., Graph Theory, Springer-Verlag, New York, 1997.
5. Harary, F., Graph Theory, Third ed., Addison-Wesley, Reading, MA, 1972.