MEGHNAD SAHA INSTITIUTE OF TECHNOLOGY

TECHNICAL REPORT (CA2)

ON

APPLICATION OF GRAPH THEORY IN

COMPUTER ENGINEERING

MAKAUT EVEN SEMESTER 2023-2024

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
NAME: SAMRAT MONDAL
STREAM: COMPUTER SCIENCE AND ENGINEERING (CSE)
YEAR: 2ND SECTION: A SEMESTER: 4
UNIVERSITY ROLL NO.: 14200122072
REGN NO.: 221420110178 of 2022-2023
PAPER NAME: DISCRETE MATHEMATICS
PAPER CODE: PCC-CS401
SESSION: 2022-2026
1
 CONTENTS
SL NO. SUBTOPIC PAGE NO.

1 ABSTRACT 3

2 KEYWORDS 3

3 INTRODUCTION 4

4 OVERVIEW 4-6

5 APPLICATIONS OF 7-10

GRAPH THEORY IN

COMPUTER

ENGINEERING

6 CONCLUSION 11

7 REFERENCES 11

8 ACKNOWLEDGEMENT 12

2
 ABSTRACT
Graph theory, an essential field of mathematics, has wide-ranging applications in
computer engineering. It offers a robust framework for representing and examining
intricate relationships and structures within computer systems. In the realm of network
design and analysis, graph
theory is instrumental in
modelling network topologies,
optimizing routing algorithms,
and ensuring fault tolerance.
Social network analysis utilizes
graph representations to
investigate the dissemination of
information and the formation
of communities. In the domain
of database management, graph databases utilize graph structures to efficiently query
and traverse relationships between data entities. Graph theory also plays a pivotal role
in compiler optimization, software engineering, and parallel and distributed computing.
Furthermore, it facilitates circuit design and analysis, enabling efficient modelling and
optimization of electronic circuits. Additionally, graph-based algorithms are employed
in data mining and machine learning for tasks such as clustering, classification, and
anomaly detection. In summary, graph theory serves as a versatile toolkit for addressing
a wide range of computational challenges in computer engineering.

KEYWORDS:
✓ Networks
✓ Optimization
✓ Analysis
✓ Modelling
✓ Algorithms
✓ Graph databases

3
 INTRODUCTION
Graph theory, a field within discrete mathematics, focuses on the study of graphs. These
graphs are mathematical structures that are used to represent relationships between
objects. Graphs are widely utilized in problem-solving
techniques due to their intuitive nature before formal
definitions are presented. When analysing the application
of graph theory, two problem areas are considered: classical
problems and problems derived from real-world
applications. Classical problems, such as connectivity, cuts,
paths and flows, colouring problems, and the theoretical
aspects of graph drawing, are defined using graph theory.
On the other hand, problems from applications place
particular emphasis on experimental research and the
implementation of graph theory algorithms. The implementation of graph drawing is a
crucial topic, as it has significant applications in various computer science technologies,
including database design, software engineering, circuit design, network design, and
visual interfaces.

OVERVIEW
GRAPH: A graph is a mathematical structure composed of a set of vertices and a set
of edges connecting pairs of vertices. Graphs are used to model relationships between
objects in various domains, such as social networks, transportation networks, and
computer networks.
Types of Graphs:
a. Directed Graph (Digraph):
➢ Definition: A graph in which each edge has a specific direction from one vertex
to another.
➢ Representation: Directed edges are indicated by arrows pointing from one
vertex to another.

4
b. Undirected Graph:
➢ Definition: A graph in which edges have no specific direction between vertices.
➢ Representation: Edges are represented by lines connecting vertices without
any arrows.

c. Weighted Graph:
➢ Definition: A graph in which each edge has an associated numerical value,
called a weight.
➢ Representation: Edges are labelled with numerical values representing
weights.

d. Unweighted Graph:
➢ Definition: A graph in which edges have no associated numerical values.
➢ Representation: Edges are simply represented by lines connecting vertices
without any additional information.

5
e. Cyclic Graph:
➢ Definition: A graph that contains one or more cycles, where a cycle is a path
that starts and ends at the same vertex.
➢ Application: Representing processes with repeating sequences.

GRAPH THEORY: Graph theory is a

mathematical field concerned with the study of
graphs, which consist of vertices (nodes)
connected by edges (links). It examines
properties like connectivity, paths, and cycles
within graphs. Widely applied in computer
science, engineering, and other disciplines,
graph theory offers a versatile framework for
modeling and analyzing relationships between
objects. By representing complex systems as
graphs, it enables solutions to problems in network design, routing algorithms, database
management, optimization, and more. Graph theory plays a fundamental role in
understanding and solving real-world problems by providing insights into the structure
and behavior of interconnected systems.
❖ Representation: Graphs represent
complex systems, allowing researchers to
visualize and analyze interconnected data
structures, facilitating solutions to real-
world problems.
❖ Key concepts: Fundamental
concepts include connectivity, paths,
cycles, and graph algorithms, essential for
understanding and solving problems within
graph-based systems.

6
 APPLICATIONS OF GRAPH THEORY IN
COMPUTER ENGINEERING:
There are following few applications of graph theory in the field of computer science
and engineering, and these are also the most significant applications of graph theory in
computer science. The applications are following-

1) Database designing: Graph

theory enhances database design by
intuitively modelling complex data
relationships. In relational databases,
entities are represented as vertices, and
relationships as edges, enabling efficient
querying and analysis of interconnected
data.
This
approach finds practical applications in
social networks, recommendation systems,
and fraud detection, where relationships
drive data analysis. Graph algorithms
further empower database systems by
identifying patterns, anomalies, and
optimizing query performance.

7
2) Operating system: Graph theory in
operating systems enhances efficiency and
functionality through various applications.
Process scheduling utilizes graph representations
to manage dependencies, optimizing resource
usage and
minimizing wait
times. Graph-based
algorithms aid in
effective scheduling. Moreover, deadlock
detection employs resource allocation graphs to
identify and prevent potential deadlocks.
Additionally, file system organization and
navigation benefit from graph structures,
facilitating efficient file access and management.

3) Network system: Graph theory

is crucial in network systems, aiding in
topology modelling, routing, fault
tolerance, and social network analysis. It
visualizes network structures,
improving understanding of
connectivity and routing. Graph
algorithms optimize data transmission
by finding efficient routing paths and
fault-tolerant strategies. Moreover,
social network analysis benefits from
identifying influential nodes and
analysing information dissemination.
Overall, graph theory significantly
enhances the design, optimization, and
management of network systems.

8
4) Data structure: Graph theory
finds significant applications in data
structures, enhancing the efficiency and
functionality of various algorithms and
structures. One primary application is in
the representation and manipulation of
graphs themselves, enabling the efficient
storage and traversal of interconnected
data. Graph algorithms, such as breadth-first
search (BFS) and depth-first search (DFS), are
fundamental in traversing and searching graph
data structures. Additionally, graph theory
contributes to the design and analysis of other
data structures, such as trees and linked lists, by
providing insights into hierarchical relationships
and connectivity.

5) Image processing:
Graph theory revolutionizes
image processing, facilitating
efficient analysis, manipulation,
and comprehension of digital
images. Image analysis,
primarily conducted through
digital image processing

techniques, benefits greatly from graph-theoretic

approaches. Graphs aid in various image
processing tasks, such as finding edge
boundaries through graph search algorithms in
segmentation, aligning images via minimum
spanning trees to derive mathematical
constraints like entropy, and calculating distance
transforms and distances between pixels using
shortest path algorithms.

9
6) Data mining: Graph theory enhances
data mining by modelling datasets as graphs,
where nodes represent entities and edges
denote relationships. Graph-based algorithms
enable tasks like community detection, link
prediction, and anomaly detection, extracting
valuable
insights
from
interconnected data. This facilitates decision-
making and knowledge discovery in diverse
domains. Furthermore, graph theory improves
recommendation systems by analysing user-
item interactions, enabling personalized
recommendations. Overall, graph theory plays
a pivotal role in advancing data mining
techniques, enabling efficient analysis and extraction of insights from complex
datasets.

7) Website designing: Graph theory

revolutionizes website design by optimizing
navigation, improving SEO, and enhancing user
engagement. By modelling website structures
and organizing web pages efficiently, it ensures
smooth navigation paths for users. Moreover,
analysing link structures aids in boosting search
engine rankings, increasing website visibility.
Ultimately, these applications
contribute to a better overall user
experience, making websites more
user-friendly and appealing.
Graph theory's multifaceted
approach empowers designers to
create websites that are both
functional and aesthetically
pleasing, driving increased traffic
and user satisfaction.

10
 8) ALGORITHMS:

Algorithm Description Application

DFS Explores as far as Deleting cycles,
possible before topological sorting
backtracking.
BFS Explores neighbours Shortest path, network
level by level analysis.
Dijkstra’s Find shortest path from Routing, GPS
source to all nodes. navigation.
Bellman-ford Finds shortest path with Routing, network
negative weights. stability.
Kruskal’s Builds minimum Network design,
spanning tree. clustering.
Prim’s Constructs minimum Network design
spanning tree. resource allocation.

CONCLUSION
This paper aims to provide computer science students with comprehensive insights into
graph theory and its intersections with subjects such as operating systems, networks,
databases, and software engineering. Focused on the diverse applications of graph
theory in computer science, it delves into various aspects including algorithm design,
network topology modelling, database
management, and software optimization. By
exploring the relevance and practical
implications of graph theory across these
domains, this paper seeks to equip students
with a deeper understanding of its significance
in computer science and its applications in real-
world scenarios.

11
 REFERENCES
1. Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2009). Introduction to
Algorithms. MIT Press.
2. Sedgewick, R., & Wayne, K. (2011). Algorithms (4th Edition). Addison-Wesley
Professional.
3. Gross, J. L., & Yellen, J. (2006). Handbook of Graph Theory. CRC Press.
4. Newman, M. E. J. (2010). Networks: An Introduction. Oxford University Press.

ACKNOWLEDGEMENT
I express my deepest appreciation to Dr. Subrata Kr. Debnath Sir and Mrs. Shahana
Sengupta Madam for their exceptional mentorship and support during the creation of
this technical report. Their invaluable guidance, encouragement, and expertise have
significantly enriched the content and enhanced its quality. I am immensely grateful for
their unwavering dedication and commitment to fostering my academic and
professional development. Their contributions have been instrumental in shaping this
report, and I am sincerely thankful for their guidance.
I would like to acknowledge that this project was completed entirely by me and not by
someone else

SAMRAT MONDAL 12TH MARCH,2024

12