Paper Title:
Graph Applications to Data Structures

This paper presents a topic on Graph theory and its application to data Structures which I consider basic and useful to students in APPLIED MATHEMATICS and ENGINEERING.This paper gives an elementary introduction of Graph theory and its application to data structures. Elements of Graph theory are indispensable in almost all computer Science areas .It can be used in Some areas such as syntactic analysis, fault detection, diagnosis in computers and minimal path problems. The computer representation and manipulation of graph are also discussed so that certain algorithms can be included .A major theme of this paper is to study Graph theory and its Application to data structures Furthermore I hope the students not only learn the course but also develop their analogy perceive, formulate and to solve mathematical programs Thus Graphs especially trees, binary trees are used widely in the representation of data structures this course one can develop mathematical maturity, ability to understand and create mathematical argumentsMethod of derivation is procedure given in the text books with necessary formulae and their application . Concepts and notations from discrete mathematics are useful in studying and describing objects and problems in branches of computer science, such as computer algorithms, programming languages.

Advanced Materials Research (Volumes 433-440)
Chapter 12: Computer-Aided Design, Manufacturing and Engineering
Edited by
Cai Suo Zhang
V. Manjula, "Graph Applications to Data Structures", Advanced Materials Research, Vols. 433-440, pp. 3297-3301, 2012
Online since
January 2012
Authors: Guo Lang Chen
Abstract:In the practical applications, there is not only one critical path between nodes in the net. Therefore, it needs to find all critical paths...
Authors: Zhou Bo Xu, Tian Long Gu, Liang Chang, Feng Ying Li
Abstract:The compact storage and efficient evaluation of feasible assembly sequences is one crucial concern for assembly sequence planning. The...
Authors: Jing Feng Guo, Ran Chai, Jia Li
Abstract:In order to solution the problem of mining maximal frequent subgraph is very hard we proposed new algorithm Top-Down. The process of this...
Authors: Zhi Wen Wang
Abstract:A proper total coloring of a simple graph G is called vertex distinguishing if for any two distinct vertices u and v in G, the set of colors...
Authors: Gang Xu, Hai He Jin, Jing Liu
Chapter 15: Software and Computer in Research and Engineering Solutions
Abstract:With the development of the city, the traffic congestion and traffic accidents on the urban road increase frequently. Using traffic modeling...