IJCCT

Studies on Dimultigraph and Prograph Based Applications of Graph Theory in Computer Science

---

---

Abstract

Graph Theory has gained an impulsion in the past few years in rapacious dimensions. Day by day with rapid advancements of the technology, its demand for proper utilization of resources is increasing at a drastic rate. Simultaneously, it has emerged as one of the most powerful tools for the illustration and solution of the problems that are basically chronological in nature. And many seemingly diverse problems in computer science have been worked out with the help of this thought. A special approach (DPBA model) for different kinds of graphs and their applications in computer science is proposed in this paper. It introduces dimultigraph by considering digraph. The approaches of dimultigraph are enumerated in simple manner. Introduction of prograph in performance evaluation in the model reflects its freshness as well as widely acceptance both theoretically and in implementation.

Recommended Citation

[1] www.en.wikipedia.org/wiki/Graph_theory. [2] William S. Bowie, “Applications of Graph Theory in Computer Systems”, International Journal of Parallel Programming, Volume 5, Number 1 / March, 1976, pages 9-31. [3] www.dharwadker.org/pirzada/applications. [4] Dai Tri Man Le, “Lab 10 - Graph Theory Computer Science 1FC3”. [5] www.aix1.uottawa.ca/~jkhoury/graph.htm [6] N. Deo, “Graph Theory with Applications to Engineering and Computer Science”, PHI, 23rd edition, 2002. [7] B. Bhowmik, “Design and Analysis of Algorithm”, WBUT series, chapter 11, first edition [in press]. [8] N. Guruprasad, “Data Structures using C”, Schitech, 2nd Edition. [9] D. Samanta, “Classic Data Structures”, PHI, 2nd reprint, 2002.