NETAJI SUBHASH ENGINEERING

COLLEGE

TOPIC-APPLICATION OF GRAPH THEORY IN

ENGINEERING

NAME –SANDIP HALDER

STREAM – INFORMATION TECHNOLOGY
SECTION-B
SUBJECT- MATHEMATICS
SUBJECT CODE- BSC-301
UNIVERSITY ROLL NO. - 10900221120
CLASS ROLL NO.- 113
ABSTRACT: - Graphs are considered as an excellent modelling tool
which is used to model many types of relations amongst any physical
situation. Many problems of real world can be represented by graphs.
This paper explores different concepts involved in graph theory and
their applications in computer science to demonstrate the utility of graph
theory. These applications are presented specially to project the idea of
graph theory and to demonstrate its objective and importance in
computer science engineering.

Keywords: - Graphs, connectivity, constraints, graph coloring, graph.

1. INTRODUCTION: -Graph theory is a branch of discrete mathematics.

In mathematics and computer science, graph theory is the study of
graphs which are mathematical structures used to model pair wise
relations between objects. There is wide use of graphs in providing
problem solving techniques, because it gives an intuitive manner prior
to presenting formal definition. To analyse the graph theory
application two problem areas are considered. 1- Classical problem 2-
Problems from applications the classical problem is defined with the
help of the graph theory as connectivity, cuts, paths and flows,
coloring problems and theoretical aspect of graph drawing. Whereas
problems from application particularly emphasis on experimental
research and the implementation of the graph theory algorithms.
Graph drawing [1] is a key topic in implementation point of view,
becausethe automatic generation of drawing graph has important
applications in key computer science technologies such as data base
design, software engineering, circuit designing, network designing
and visual interfaces.

2. Graphs: - Graphs provide a convenient way to represent various kinds

of mathematical objects. Essentially, any graph is made up of two sets:
I. A set of vertices.
II. 2- A set of edges.

Depending on the particular situation, restrictions are imposed on the

type of edges we allow. For some
problems directed edges are applied and for other problem undirected
edges are applied from one vertex to other. So, graphs give us many
techniques and flexibility while defining and solving a real-life problem.
Graphs has many provides abstracted view  establishes relationship
among objects  balancing  modelling  decision -making ability 
structural arrangement of various objects  easy modification or change
in the existing system.
2. APPLICATION IN COMPUTER SCIENCE
2.1 Data base designing - Data base designing in data base designing
graphs are used as graph data bases. Graph database uses graph
representation with nodes, edges,and properties to represent and store
data. This graph structure has key role in designing database, because it
gives fast implementation process using different functionality and
properties of graph structure. Graph database uses as:
➢ Storage system that provides index free adjacency
➢ Analysing tool for interconnection
➢ Powerful tool for graph like-query

 Graph databases are often faster for associative data sets that map
more directly to the structure of object-oriented applications matures,
some of them are:
2.2 Software engineering - Graph has many applications in software
engineering. For example: during Requirements Specification, Data Flow
diagrams are used where vertices represent transformations and edges
represents the data flows. During Design phase, graphical design is used
for describing relations among modules; while during Testing, the
control flow of a program associated with McCabe's complexity measure
which employs directed graphs for addressing the sequence of executed
instructions and etc. Even Software Process Management has also
applications of network diagrams which involves graph algorithms.
2.3 Network system - Graph theory has wide application in the field
of networking. To analyse the graph theory application in networking
two
areas are considered: graph-based representation and network theory.
Graph based representation has many advantages such as it gives
different point of view; it makes problem much easier and provide more
accurate definition. Whereas network theory provides a set of techniques
for analysing a graph and applying network theory using a graph
representation. The term graph and network are equal. Both refer to a
type of structure in which there exists vertices (i.e., nodes, dots) and
edges (i.e., links, lines). There are numerous types of graphs and
networks which yield more or less structure. These two terms can be
differentiating on the basis of their utility. the term graph is used in
mathematics whereas the term network is used in physics.
2.3.1 Purpose of a Graph in mathematics
➢ Mathematicians are concerned with the abstract structure of a graph.
➢ Mathematician’s define operations to analyse and manipulate
graphs.
➢ They develop theorems based upon structural axioms.
2.3.2 Purpose of a Network in physics
➢ Physicists are concerned with modelling real-world structures
withnetworks.
➢ Physicist’s define algorithms that compress the information in a
➢ network to more simple values (e.g., statistical analysis).
Graph theoretic concepts are applied in several fundamental issues in
network such as connectivity, data gathering, routing, mobility, energy
efficiency, topology control, traffic analysis, finding shortest path and
load balancing.
3.4 Computer hardware - in computer hardware graph theory
conceptsare used to model the limitation of the physical layer. Graph
theory concepts are used in hardware world to provide:
➢ Register allocation by graph coloring
➢ Representation of instruction sequences by graphs by adjacency
matrix
➢ In instruction parallel processing
➢ Process of allocation scheduling
3.5 Data structure - Data may be organized many different ways.
Thelogical or mathematical model of a particular organization of
data is called a “data structure”. The choice of data model depends
on two considerations:
➢ It must be rich enough in structure to mirror actual relationship of
datain real world.
➢ The structure should be simple enough that one can
effectivelyprocess data when necessary.
. These two considerations are fulfilled by the graph theoretical concepts.
Arbitrary relation among data can also be represented by a graph and its
matrices, operations performed on these metrics are further useful for
deriving relations and data association and is useful in order to
understand how these data may be stored in memory.
3.6 Image processing - Image Analysis is the methodology by which
information from images is extracted. Image analysis is mainly
performed on digital image processing techniques. The image processing
techniques can be improved using a graph theoretic approach. The
applications of graphs in image processing are: to find edge boundaries
using graph search algorithms in segmentation.
➢ To calculate he alignment of the picture
➢ Finding mathematical constraints such as entropy by using
minimumspanning tree.
➢ Finding distance transforms of the pixels and calculates the
distancebetween the interior pixels by using shortest path
algorithms.
3.7 Data mining - Graph mining is the main application area of graph
theory in data mining. Graph mining represents the relational aspect of
data. There are five theoretical based approaches of graph-based data
mining. They are sub graph categories, sub graph isomorphism, graph
invariants, mining measures and solution methods.
3.8 Operating system - A graph is a data structure of finite set of pairs,
called edges or vertices. Many practical problems can be solved with the
help of graph in the field of operating system such as job scheduling and
resource allocation problems. For example, graph colouring concept can
be applied in job scheduling problems of CPU, jobs are assumed as
vertices of the graph and there will be an edge between two jobs that
cannot be executed simultaneously and there will be one to one
relationship between feasible scheduling of graphs
3.8.1 Graph purpose in operating system
➢ System processes are represented in graph form.
➢ Graph extraction techniques are used in event tracing.
➢ Excellent testing tool in performance evaluation because of
easyvalidation and modification.
3.9 Website designing - Website designing can be modelled as a graph,
where the web pages are represented by vertices and the hyper links
between them are represented by edges in the graph. This concept is
known as web graph. Which discover the interesting information? Other
application areas of graphs are in web community. Where the vertices
represent classes of objects, and each vertex representing one type of
objects, and each vertex representing a type of object is connected to
every vertex representing other kind of objects. In graph theory such a
graph is called a complete bipartite graph. There are many advantages of
using graph representation in website development such as:
➢ Searching and community discovery.
➢ Graph representation (directed graph) in web site utility
evaluationand link structure.
➢ Finding all connected component and provide easy detection.
RESULT AND DISCUSSION: -
Application field Property and Applications area Uses
concepts of graph
theory
Database designing Index-free adjacency Graph database Analysing
interconnection,
Direct mapping and
Natural scaling to
large data sets
Software engineering Connectivity and Data DFD, Control flow Transformations,
flow, Directed graph, graph, ER-diagram, capturing
and cyclomatic process sequencing requirements,
complexity and software quality describing relations
[12] among modules,
Designing system and
in testing process.
Computer hardware Graph colouring and Coloring algorithms Compilers uses graph
Matrix representation. Fine-grain parallelism coloring algorithms for
analysis, Data Register allocation to
dependence matrix variables, calculate
parallelism degree,
very useful in
analytical modelling
[3], Addressing the
sequence of
instruction execution,
Resource allocation
and economizing the
memory space (file
organization).
Network design Connectivity, Topological control Finding shortest path,
Traversing, Adjacency, and Weighted graph, Searching and
Vertex cover Butterfly network and Arrangement of nodes
algorithms and 2-D array in network designing,
Different graph Modelling
representation. communication
networks [7], Traffic
analysis and in
Network security
Data Structure Directed graphs, Array, Tree, Linked list, Efficient organization
Matrices and Matrices Pointers, Stacks, and of data, finding
operation. Queue minimum cost tree,
minimizing data
retrieval times,
minimizing page
swapping in data
structure paging
system and Provides
link structure in
websites
Image processing Edge connectivity, Edge boundaries, Segmentation and
Regions, Spanning Entropy, Shortest path registration, Distance
tree. algorithms and Search transform and Centre
algorithms line extraction
Data mining Sub graphs, Graph mining Sub structure
Isomorphism. matching, Reducing
search space.
Operation system Graph coloring, Job scheduling Provide feasible
Directed grip. problems and solution to job
Simultaneous scheduling and
execution of job Efficient
resource(processor)
allocation in solving
simultaneous job
execution
problems.[8] and in
process
representation
Web site designing Directed graph, Web graph, Web Community discovery,
Undirected graph, In pages and Hyperlinks Searching and Website
degree and out evaluation
degree, Search
algorithms and
Bipartite graph.

❖ CONCLUSION: - Graph theory has found widespread

application in numerous fields. In turn fields have stimulated the
development of many new graph-theoretical concepts and led to
many challenging graph theory problems. We can anticipate that
the continued interplay between graph theory and many areas of
application will lead to important new developments.

❖ ACKNOWLWDGEMENT: - I WOULD LIKE TO EXPRESS MY

SPECIAL THANKS OF GRATITUDE TO OUR TEACHER ADG SIR
WHO GAVE ME THE GOLDEN OPPORTUNITY TO DO THIS
WONDERFUL PRESENTATION ON THE TOPIC FIRST ORDER
ORDINARY DIFFERENTIAL EQUATION, WHICH ALSO HELPED
ME IN DOING A LOT OF RESEARCH AND I CAME TO KNOW
ABOUT SO MANY NEW THINGS.
 ❖ REFERENCES: -
[1] Graph algorithms and applications: special issue by Nishizeki,
Takao; Tamassia, Roberto; Wagner, Dorothea. - Berlin: Springer, 2000. -
(Algorithmica: 26. 2000, 1)
[2] Designing Graph Database Models from Existing Relational
Databases by Subhrajyoti Bordoloi Bichitra Kalita Dept. Of Computer
Applications Dept. Of Computer Applications Assam Engg. College,
Guwahati, Assam Engineering. College, Guwahati, Assam.(International
Journal of Computer Applications (0975 -8887), Volume 74, no-1,July
2013) & GOOGLE.
.

THE END