NETAJI SUBHUSH ENGINEERING COLLEGE

TOPIC 2 - Application of Graph Theory

in Data Structure

Name – SANDIP HALDER

Stream – Information Technology
Semester – 4th
Section - B
Class Roll – 113
University Roll – 10900221120
Subject Name – Discrete Mathematics
Subject Code – PCC-CS401
 CONTENT
1. ABSTRACT
2. INTRODUCTION
3. GRAPH DATA STRUCTURE
4. FEATURES AND PROPERTIES OF GRAPH
5. REAL LIFE APPLICATION OF GRAPH DATA STRUCTURE
6. REAL LIFE EXAMPLES OF GRAPH DATA STRUCTURE
7. CONCLUSION
8. REFERENCE
9. ACKNOWLEDGEMENT
ABSTRACT
This paper deals with computer data structures. These data structures can be
represented by directed graph structures and the purpose of this paper is to
show how methods and techniques of graph theory can then be used to
process these graphs. A viewpoint is taken that a basic tree structure exists in a
general data structure. If this tree structure can be extracted, or identified
during the creation of the data structure, then it can be used to make
comparisons with other basic tree structures. An algorithm to find the greatest
common structure of two trees is presented. If a cost function is associated with
the arcs of a graph structure, then a minimum cost tree can be derived. This
has application in minimizing data retrieval times and in minimizing page
swapping in data structure paging systems. Arbitrary relations among data can
also be represented by a graph and its matrices. It is shown that, by means of
standard operations on these matrices, operations can be performed on these
relations to derive further relations and logical data associations. A general
model builder system, with which some of the above ideas will be investigated,
is briefly investigated.

INTRODUCTION
"Graphs have a wide range of applications in fields of study like computer
science, mathematics, and engineering and are an effective tool for
representing and analysing complex relationships between data.”
In this report, we will discuss the application of graph data structures
and examine how they can be used to solve real-world problems.

GRAPH DATA STRUCTURE

A graph is a non-linear data structure. It comprises a finite number of

nodes and the edges that connect them. The edges can be directed
(representing a one-way relationship) or undirected (representing a two-
way relationship).
Graphs are commonly used to describe networks of relationships
between objects, such as social networks, transportation networks, and
the internet.
Numerous problems, like determining the shortest route between two
points or spotting patterns and connections in sizable datasets, can be
modelled using them. The application of graph data structure is used in
computer science, mathematics, and physics and has many practical
applications in fields such as computer networks, artificial
intelligence, and logistics

Features and Properties of Graphs

A graph is a type of mathematical representation of a set of objects called

vertices or nodes, and the connections are called edges. Some common
features and properties of graphs include:

1. Degree: The degree of a vertex is the number of edges incident to it.

2. Path: A path in a graph is a sequence of edges that connects

two vertices.

3. Connected: A graph is said to be a connected graph if a path exists

between every pair of vertices.

4. Complete: A graph is said to be a complete graph if there is an edge

between every pair of vertices.
5. Directed/Undirected: A graph is said to be directed if edges have a
direction and undirected if edges do not.

6. Weighted/Unweighted: A graph is said to be weighted if edges have

a value or weight associated with them and unweighted if they do not.

7. Cyclic/Acyclic: A graph is cyclic if a path begins and ends at the

same vertex and acyclic if there is no such path.
8. Subgraph: A subgraph of a graph is a graph that is a subset of the
vertices and edges of the original graph.

9. Adjacency Matrix: A matrix representation of a graph where rows and

columns represent vertices, and the entries indicate the presence or
weight of edges between them.

10. Incidence Matrix: A matrix representation of a graph where rows

represent vertices, columns represent edges, and the entries indicate the
presence of a vertex in an edge.
Real-Life Applications of Graph Data Structure

Real-life application of graph data structure in various fields are:

1. Computer Science: Graphs are used to model many problems and
solutions in computer science, such as representing networks, web
pages, and social media connections. Graph algorithms are used in
pathfinding, data compression, and scheduling.
2. Social Networks: Graphs represent and analyse social networks,
such as the connections between individuals and groups.
3. Transportation: Graphs can be used to model transportation
systems, such as roads and flights, and to find the shortest or
quickest routes between locations.
4. Computer Vision: Graphs represent and analyse images
and videos, such as tracking objects and detecting edges.
5. Natural Language Processing: Graphs can represent and analyse
text, such as in syntactic and semantic dependency graphs.
6. Telecommunication: Graphs are used to model telecommunication
networks, such as telephone and computer networks, and to analyse
traffic and routing.
7. Circuit Design: Graphs are used in the design of electronic
circuits, such as logic circuits and circuit diagrams.
8. Bioinformatics: Graphs model and analyse biological data, such as
protein-protein interaction and genetic networks.
9. Operations research: Graphs are used to model and analyse
complex systems in operations research, such as transportation
systems, logistics networks, and supply chain management.
10. Artificial Intelligence: Graphs are used to model and analyse data
in many AI applications, such as machine learning, Artificial
Intelligence, and natural language processing.

Real-life Example of Graph Data Structure

Some real-life examples of the application of graph data structure are: -

 1. Social Network: In a social network, individuals (represented as nodes)
are connected through relationships (represented as edges). The nodes
in this graph represent the individuals, and the edges represent their
relationships, such as friendships or connections. The graph can analyse
data such as the number of connections an individual has, the most
popular individuals in the network, and the formation of communities
within the network.
2. Transportation Network: A transportation network is another real-life
example of a graph data structure. This could include a map of roads
and highways, with intersections represented as nodes and the roads
connecting them represented as edges.
The graph can be used to find the shortest route between two locations,
the number of routes between two places, and the overall connectivity
of the transportation network. Additionally, it can be used for traffic
management, route optimization, and fleet management. In short, the
transportation network is an excellent example of a graph data structure
that can be used to model real-world problems with nodes and edges.

CONCLUSION
Due to growing the application of Artificial Intelligence, Machine Learning,
Deep Learning, Data Science, and Cryptography in various fields like Health
Science, Social Science, Manufacturing Industry, Defence services, and
different government activities, the graph theoretical approach, and its
application is a very demanding subject for the researcher. After finishing the
study of graph theory, students may be able to apply their knowledge of
graph theory in various fields of modern science.

REFERENCE
1. K. Appel and W. Hankins, "Every planar map is 4-colorable," Bulletin of
the AMS, Volume 82 (1976), 711-712.
2. A. Beck, M. Bleicher and D. Crowe, Excursion into Mathematics, Worth
Publishers, 1969 (ISBN 0-87901-004-5). The first chapter (about 80 pages)
introduces graph theory and many of its most interesting topics. This book
is written for those with two or three years of high school mathematics.
3. N. Biggs, E. Lloyd, and R. Wilson, Graph Theory 1736-1936, Clarendon
Press Oxford, 1976 (ISBN 0-19-853901-0). This book gives a self-
contained historical introduction to graph theory using thirty-seven extracts
from original articles (translated when necessary).
 4. E. B. Dynkins and V. A. Uspenskii, Multicolor Problems, D. C. Heath and
Company, Boston, 1963. This excellent book predates the Four Color
Theorem's proof.

ACKNOWLEDGEMENT

I would like to express my special thanks of gratitude to my teacher who gave me

the golden opportunity to do this wonderful project on the topic Application of
Graph Theory in data structure, which also helped me in doing a lot of Research
and I came to know about so many new things I am really thankful to them