An Overview Study on Applications of Graph Theory in Computer Science
DOI:
https://doi.org/10.29070/2jpyes30Keywords:
graph theory, applications, computer science, graphs, relations, real world, concepts, utility, building, network, constraints, graph coloring, graph drawing, heterogeneous fields, booking concepts, overviewAbstract
Graphs are considered as a superb displaying device which is utilized to demonstrate many kind of relations among any physical circumstance. Numerous issues of genuine world can be spoken to by graphs. This paper investigates various concepts engaged with graph theory and their applications in computer science to exhibit the utility of graph theory. These applications are displayed particularly to extend graph theory and to exhibit its target and significance in computer science building. Graphs, network, imperatives, graph shading, graph drawing. This paper gives a review of the applications of graph theory in heterogeneous fields somewhat yet for the most part centers around the computer science applications that utilizations graph hypothetical concepts. Different papers dependent on graph theory have been considered identified with booking concepts, computer science applications and an outline has been introduced here.Downloads
References
F.R.K. Chung and L. Lu (2006). Complex Graphs and Networks, volume 107 of CBMS Regional Conference Series in Mathematics. American Mathematical Society.
Y. Breitbart, M. Garofalakis, C. Martin, R. Rastogi, S. Seshadri and A. Silberschatz (2000). “Topology Discovery in Heterogeneous IP Networks” In Proceedings of IEEE INFOCOM.
H. Gobjuka and Y. Breitbart (2010). Ethernet topology discovery for networks with incomplete information. In IEEE/ACM Transactions in Networking, pages 18: pp. 1220–1233.
Saleh Ali K. Al Omari and Putra Sumari (2010). “An overview of Mobile Ad Hoc Networks for the existing protocols and applications”, International Journal on applications of graph theory in wireless ad hoc networks and sensor networks, vol. 2, no. 1, March 2010.
K. Ahmat (2009). Ethernet Topology Discovery: A Survey," CoRR, vol. abs/0907.3095.
K. Ahmat (2009). Graph Theory and Optimization Problems for Very Large Networks. City University of New York, United States.
S. Sumathy et. al. (2010). “Secure key exchange and encryption mechanism for group communication in wireless ad hoc networks ”, Journal on Applications of graph theory in wireless ad hoc networks and sensor networks, Vol. 2, No 1.
van Steen M. (2010). Graph Theory and Complex Networks: An Introduction. Maarten van Steen.
F.R.K. Chung and L. Lu (2006). Complex Graphs and Networks, volume 107 of CBMS Regional Conference Series in Mathematics. American Mathematical Society.
B. Donnet, T. Friedman (2007). Internet topology discovery: A survey, Communications Surveys & Tutorials, IEEE 9, pp. 56–69.
Y. Breitbart, F. Dragan, and H. Gobjuka (2004). “Effective network monitoring,” in International Conference on Computer Communications and Networks (ICCCN).
S. G. Shirinivas, S. Vetrivel, and N. M. Elango (2010). “Applications of graph theory in computer science—an overview,” International Journal of Engineering Science and Technology, vol. 2, no. 9, pp. 4610–4621.
Oliveira, L.B., Wong, H.C., Dahab, R., Loureiro, A.A.F. (2007). On the design of secure protocols for hierarchical sensor networks. International Journal of Security and Networks (IJSN) 2(3/4) pp. 216–227 Special Issue on ryptography in Networks.
P. C. Lee, V. Misra, and D. Rubenstein (2007). Distributed algorithms for secure multipath routing in attack-resistant networks. IEEE/ACM Transactions on Networking, 15(6): pp. 1490–1501.
R. van der Hofstad (2011). Random Graphs and Complex Networks, (manuscript available at: www.win.tue.nl/rhofstad/NotesRGCN2011.pdf).
This work is licensed under a 