See discussions, stats, and author profiles for this publication at: https://www.researchgate.

net/publication/353285726

Graph Theory and its Applications in Computer Science and Engineering

Article in International Journal of Engineering and Management Research · August 2015

CITATION READS
1 3,742

2 authors:

Vinutha Ms Arathi Puranik

Dr. Ambedkar Institute of Technology Dr. Ambedkar Institute of Technology
9 PUBLICATIONS 14 CITATIONS 2 PUBLICATIONS 10 CITATIONS

SEE PROFILE SEE PROFILE

All content following this page was uploaded by Vinutha Ms on 16 July 2021.

The user has requested enhancement of the downloaded file.

www.ijemr.net ISSN (ONLINE): 2250-0758, ISSN (PRINT): 2394-6962

Volume-5, Issue-4, August-2015

International Journal of Engineering and Management Research
Page Number: 317-319

Graph Theory and its Applications in Computer Science and Engineering

M S Vinutha1, Arathi P2
1,2
Assistant Professor, Department of CSE, Dr. Ambedkar Institute of Technology, Banagalore, INDIA

ABSTRACT Kirchhoff in 1845 used theoretical concepts of graph to

Mathematics plays an important role in various fields.
The use of mathematics is also seen indifferent areas of
computer science such as design of algorithms, Artificial
intelligence, software architecture, multiprocessing etc. Graph
theory is an important field in mathematics which is used in
structural models. Graph can be used in research areas of
computer science such as data mining, clustering, image
capturing, networking, data structure etc. This paper gives an
overview of graph concepts and applications of graph
application in various fields of computer science.
Keywords---- Graphs, Graph coloring, connectivity,
Bipartite graph
I. INTRODUCTION
Graph theoretical concepts are widely used to
study and model various application in different fields. In
computer science graph theory is the study of graphs which
are mathematical structures used to model pair wise relations
between objects from certain collection. Graph can also be
represented as tree which is used in designing data structures
making use of vertices and edges. Forming an efficient LAN
using network topologies, fault diagnostics in computer
network, finding shortest route in travelling salesman
problem, resource allocation and scheduling uses path, walk,
circuit, cut sets, coloring and other concepts of graph theory.
II. HISTORY
calculate currents in electrical circuits. In 1852 famous four
color problem was found by Thomas Gutherie and it was
solved by Kenneth Appel and Wolfgang Haken. The well
known Hamiltonian graph was invented by Thomas P
Kirkman and William R Hamilton in 1856. This period was
considered as the Birth of Graph Theory [1].
III. GRAPHS
A graph is a collection of points called nodes or
vertices connected by lines called arcs or edges. Depending
on problems the graph considered may be an undirected
graph or directed graph. In some situations edges may be a
loop or a weighted edge. Graphs have many features and
some of them are providing abstract view, establishing
relation between objects, easy modification or extension in
the existing system and decision making ability.
To study and model various applications in
different areas graph theoretical concepts are used. In
chemistry to study atoms, molecules and constructions of
bonds graph concepts are used. In biology to study breeding
patterns, tracking spread of disease, impact of migrations
that affects other species use graph theory. In operation
research to solve travelling sales man problem, locating
shortest path between two vertices and obtaining optimal
match of jobs graphs are used. In large complicated projects
for planning and scheduling graphs are used. Graphs are
used to solve problems in engineering, economics and war
science to find optimal way to complete tasks in competitive
environment.

The field graph theory stated with Konigsberg
bridge problem or seven bridge problem in 1735. Euler
studied this problem and formed a structure to solve this
problem called Eulerian graph. In 1840 A. F Mobius
introduced idea of complete graph, bipartite graph and
Kuratowski graph that are used in planar detection. Gustav
IV. ALGORITHM and LANGUAGES
The key role of graph theory in computer science is the
development of algorithms. These algorithms are used to
solve problems that are modelled in the form of graphs.
Some algorithms are as follows:

317 Copyright © 2011-15. Vandana Publications. All Rights Reserved.

www.ijemr.net
1. DFS and BFS algorithm for searching elements in
data structures.
2. Elementary reduction for finding graphs planarity.
3. Dijkstra’s algorithm to find shortest path in a
network.
4. Algorithm to find connectedness.
5. Algorithm to find minimal spanning tree and so on.
Various computer language support graph theory
concepts. The main goal of such language is make user to
perform operations on graphs in compact and natural
manner. Some graph theoretical languages are:
1. GIRL-Graph Information Retrieval Language.
2. FGRAAL- FORTRAN Extended Graph
Algorithmic Language.
3. GTPL- Graph Theoretic Language
4. GASP-Graph Algorithm software package.
5. SPANTREE- To Find a Spanning tree in a graph.
6. HINT and GRASPE-Extension of LISP and so on
[2].
V. APPLICATIONS OF GRAPH & ITS
CONCEPT IN COMPUTER SCIENCE
Graph coloring: it is assigning colors to the
vertices of graph with minimal number colors such that no to
adjacent vertices will have same color as shown in figure-1 .
The minimum color used for coloring is called chromatic
number. This has variety of applications in scheduling.
Figure-1 chromatic number of graph is 4
Operating system: A graph is a data structure of
finite set of pairs, called nodes and edges. Many problems in
the field of operating system such as job scheduling and
resource allocation problems can be solved with the help of
graph. Graph coloring concept can be applied in job
scheduling problems of CPU, jobs are assumed as nodes 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]
Aircraft scheduling: Assuming that there are k aircrafts
and they have to be assigned n flights. The ith flight should
be during the time interval (a i , b i ). If two flights overlap,
318 Copyright © 2011-15. Vandana Publications. All Rights Reserved.
ISSN (ONLINE): 2250-0758, ISSN (PRINT): 2394-6962
then the same aircraft cannot be assigned to both the flights.
This problem is modeled as a graph as follows. The flights
are represented as nodes of the graph .Two nodes will be
connected, if the corresponding time intervals overlap.
Therefore, the graph is an interval graph that can be colored
optimally in polynomial time. [4]
Time table scheduling: Allocation of classes and
subjects to the teachers is one of the major issues if the
constraints are complex. Graph theory plays an important
role in this problem. For m teachers with n subjects the
available number of p periods timetable has to be prepared.
Computer hardware: Graph theory concepts are used
in computer hardware to model the limitation of the physical
layer. Graph theory concepts are used in hardware world to
provide register allocation by graph coloring and adjacency
matrix to represent instruction sequence.
VI. CONNECTIVITY, ADJACENCY
Software engineering: Graph has many
applications in software engineering. Data Flow diagrams
are used to specify requirements specification where vertices
represent transformations and edges represents the data
flows. Graphical design is used in design phase, for
describing relations among modules. During Testing the
control flow of a program associated with complexity
measure uses directed graphs. Network diagrams are used in
Software Process Management which involves graph
algorithms.[8]
Network system: Graph theory has wide
application in networking field. Graph theory application in
networking includes two areas: graph based representation
and network theory. Graph based representation gives
different point of view and makes problem much easier. It
provides more accurate definition. Network theory provides
a set of techniques for analyzing a graph and applying
network theory using a graph representation. The term graph
and network are same. Both refer to a type of structure in
which there exists nodes and edges. Graph concept like can
be used to issues like connectivity, routing, topology, traffic
analysis etc.[5]
Image processing: Information from images is
extracted by image analysis methodology. Image analysis is
mainly performed on digital image processing techniques.
Graph theoretic approach improves image processing
techniques. The applications of graphs in image processing
are:
 To find edge boundaries using graph search
algorithms in segmentation.
 To calculate the alignment of the picture.
 Finding mathematical constraints such as entropy
by using minimum spanning tree.
www.ijemr.net ISSN (ONLINE): 2250-0758, ISSN (PRINT): 2394-6962

 Finding distance transforms of the pixels and journal of computer application volume 104-No.1, octomber
calculates the distance between the interior pixels 2014.
by using shortest path algorithms. [4]Applications of graph theory in computer science by
Ferozuddin Riaz and Khidir M Ali, 2011 third international
VII. SEARCH ALGORITHMS AND conference on computational intelligence, communication
BIPARTITE GRAPHS system and networks.
[5] Graph algorithms and applications:special issue by
Website designing: Website designing can be Nishizeki, Takao, Tamassia, Roberto, Wagner, Dorothea.
modeled as a graph. Web pages are represented by vertices Berlin, Springer, 2000.
and the hyper links between them are represented by edges [6] K. Appel and W. Haken, Every Planar Map is Four
in the graph. This concept is known as web graph. The Colorable, Bull. Amer. Math. Soc. 82 (1976) 711-712.
concept of complete bipartite graphs are used where [7] On the application of graph theory to computer data
vertices represent classes of object, one type of object is structure by R.Williams.
connected to object of same kind with the help of edges. [8] Graph theory application in developing software test
There are many advantages of using graph representation in strategies for networking system by Vladimir. V. Riabov
website development such as: (2007).
 Searching and community discovery. [9] Application of graptheory incommunication networks by
 Utility evaluation and link structure for web site sumandeswal andAnitasinghrova, International Journal of
 Provide easy detection for all components Application or Innovation in Engineering & Management
connected. (IJAIEM), Volume 1, Issue 2, October2012
Data mining: Graph mining concept of graph
theory is used in data mining. Graph mining represents the
relational aspect of data. In data mining the five theoretical
approaches of graph that is subgraph categories, sub graph
isomorphism, graph invariants, mining measures and
solution methods are used.[3]
Data structure: There are different ways to store data
in a computer system. Based on application a list or a matrix
representation can be used. List structures are used for
sparse graph and matrix structure provides faster access. The
list uses less memory where as matrix consume more
memory. In list there are two type incidence list and
adjacency list. In matrix there are incident matrix, adjacency
matrix and distance matrix. [4]

VIII. CONCLUSION
The main aim of this paper is to present the
importance of graph theory principles and ideas in different
fields of computer science. The researchers can use these
concepts to model and optimize different process in fields
like operating system, networks, software engineering, data
structure etc.,

REFERENCES
[1] Application of graph theory in computer science an
overview by S G Shrinivas, S Vetrivel and Dr N M Elango,
International journal of engineering science and technology ,
vol-2(9), 2010,4610-4621.
[2] N. Deo, “Graph theory with applications to Engineering
and computer science”, Prentice Hall of India, 1999.
[3] Application of graph theory in computer science and
engineering by Rishi pal Singh and Vandana, International

319 Copyright © 2011-15. Vandana Publications. All Rights Reserved.

View publication stats