Research Article
Year 2017,
Volume: 5 Issue: 1, 264 - 268, 01.01.2017
Abstract
References
- Berge, C., Theory of Graphs and its Applications, Methuen, London, 1962.
- Bondy, J.A. and Murty, U.S.R. Graph Theory with Applications, North-Holland, Elsevier, 1981.
- Chartrand, G., and Lesniak, L., Graphs And Digraphs, Chapman & Hall, 3 ^rd Edn., 1996.
- Diestel, R., Graph Theory, Springer-Verlag, New York, 1997.
- Harary, F., Graph Theory, Third ed., Addison-Wesley, Reading, MA, 1972.
Year 2017,
Volume: 5 Issue: 1, 264 - 268, 01.01.2017
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
References
- Berge, C., Theory of Graphs and its Applications, Methuen, London, 1962.
- Bondy, J.A. and Murty, U.S.R. Graph Theory with Applications, North-Holland, Elsevier, 1981.
- Chartrand, G., and Lesniak, L., Graphs And Digraphs, Chapman & Hall, 3 ^rd Edn., 1996.
- Diestel, R., Graph Theory, Springer-Verlag, New York, 1997.
- Harary, F., Graph Theory, Third ed., Addison-Wesley, Reading, MA, 1972.
There are 5 citations in total.
Details
| Primary Language | English |
|---|---|
| Journal Section | Articles |
| Authors | |
| Publication Date | January 1, 2017 |
| Published in Issue | Year 2017 Volume: 5 Issue: 1 |
