GRAPH THEORY FINAL

PROJECT REPORT
Implementation of Graph Theory Techniques in
Different Fields

SUBMITTED BY : DANISH SARWR

STUDENT ID: 12217031
GRAPH THEORY FINAL REPORT HOMEWORK
SUBMISSION
DATE: NOVEMBER 11 ,2022
DALIAN UNIVERSITY OF TECHNOLOGY

1
Table of Contents
Introduction: ..................................................................................................................................................... 3
1.Classical problem........................................................................................................................................... 3
2.Problem from application .............................................................................................................................. 3
2.2 Software engineering ........................................................................................................................ 4
2.3 Network system ................................................................................................................................ 4
2.3.1 Purpose of a Graph in mathematics .............................................................................................. 5
2.3.2 Purpose of a Network in physics................................................................................................... 5
2.4. Computer hardware................................................................................................................................ 5
2.5 Data structure .................................................................................................................................... 5
2.6 Image processing .............................................................................................................................. 6
2.7 Data mining....................................................................................................................................... 6
2.8 Operating system .............................................................................................................................. 6
2.9 Website designing ............................................................................................................................. 6
3. Application of graph theory in human life ............................................................................................ 7
3.1 Traveling Salesman Problem: ........................................................................................................... 8
3.2 Vertex Coloring: ............................................................................................................................... 8
4. Conclusion: ................................................................................................................................................... 9

2
Introduction:

Graph are considered as a magnificent demonstrating instrument which is used to demonstrate

many kind of relations among any physical circumstance. Many problems of real world can be
represented by graphs. There is wide utilization of graphs in giving problem thinking strategies.
There are two kinds of problems to analyze graph theory applications

1- Classical problem
2- Problems from applications

1. Classical problem
The classical problem are defined with the help of the graph theory as connectivity, cuts,
paths and flows, coloring problems and theoretical aspect of graph drawing.
2. Problem from application
Problems from application particularly emphasis on experimental research and the
implementation of the graph theory algorithms. Graph drawing is a critical subject in
execution perspective, on the grounds that the programmed because the 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.

Graphs
Graphs provide a convenient way to represent various kinds of mathematical objects.
Essentially, any graph is made up of two sets:

1- A set of
vertices 2- A set
of edge
Depending upon the specific circumstance, limitations are forced on the sort of edges we
permit. For certain issues coordinated edges are applied and for other issue undirected edges are
applied from one vertex to other so graphs provide us various techniques and flexibility while
defining and solving a real life problem Graphs has a lot of features, some of them are:
 provides abstracted view
 establishes relationship among objects
 balancing
3
  modeling
 decision -making ability
 structural arrangement of various objects
 easy modification or change in the existing system

2. Graph theory application in Computer Science

2.1 Data base designing:

In data-base planning graph are utilized as diagram information bases Graph data set uses
diagram portrayal with hubs, edges, and properties to address and store information. This
diagram structure plays key part in planning information base, since it gives quick execution
process utilizing diverse usefulness and properties of graph structure Graph database uses as:

 Storage system that provides index free adjacency

 Analyzing 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.

2.2 Software engineering

Graph has numerous application 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 many applications in the field of networking. To analyze 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
4
theory provides a set of techniques for analyzing 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 uses. 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 analyze and manipulate graphs.

 They develop theorems based upon structural axioms.

2.3.2 Purpose of a Network in physics

 Physicists are concerned with modeling real-world structures with networks.

 Physicists define algorithms that compress the information in a network to more simple
values (e.g. statistical analysis).

2.4. Computer hardware

In computer hardware graph theory concepts are 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

2.5 Data structure

Data may be organized many different ways. The logical or mathematical model of a
particularorganization of data is called a “data structure”. The choice of data model depends on
5
two considerations:

 It must be rich enough in structure to mirror actual relationship of data in real world
 The structure should be simple enough that one can effectively process data when
necessary.

2.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 minimum spanning tree.

 Finding distance transforms of the pixels and calculates the distance between the interior pixels
by using shortest path algorithms.

2.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.

2.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 coloring 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.

2.9 Website designing

Website designing can be modeled as a graph, where the web pages are represented by

6
 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
websitedevelopment such as:

 Searching and community discovery.

 Graph representation (directed graph) in web site utility evaluation and link structure.

 Finding all connected component and provide easy detection.

3. Application of graph theory in human life

Someone has described some graph theory applications in desiging GSM these techniques
deal with the determination of the base station identity code (BSIC), hopping sequence number
(HSN), and location area code (LAC). It is shown that GSM radio network planning involves a
number of optimization problems and Time Table Scheduling Problems which can be treated by
graph theoretical methods. Graph theory is used in biology and conservation efforts where a
vertex represents regions where certain species exist and the edges represent migration path or
movement between the regions. This information is important when looking at breeding
patterns or tracking the spread of disease, parasites and to study the impact of migration that
affect other species. Graph theoretical concepts are widely used in Operations Research. For
example, the traveling salesman problem, the shortest spanning tree in a weighted graph,
obtaining an optimal match of jobs and men and locating the shortest path between two vertices
in a graph. It is also used in modeling transport networks, activity networks and theory of
games. The network activity is used to solve large number of combinatorial problems. The most
popular and successful applications of networks in OR is the planning and scheduling of large
complicated projects. The best well known problems are PERT(Project Evaluation Review
Technique) and CPM (Critical Path Method). Next, Game theory is applied to the problems in
engineering, economics and war science to find optimal way to perform certain tasks in
competitive environments.

7
To represent the method of finite game a digraph is used. Here, the vertices represent the
positions and the edges represent the moves.

3.1 Traveling Salesman Problem:

TSP is a very well-known problem which is based on Hamilton cycle. The

problem statement is: Given a number of cities and the cost of traveling from any
city to anyother city, find the cheapest round-trip route that visits every city exactly
once and return to the starting city.

In graph terminology, where the vertices of the graph represent cities and the edges
represent the cost of traveling between the connected cities (adjacent vertices), traveling
salesman problem is just about trying to find the Hamilton cycle with the minimum
weight. This problem has been shown to be NP-Hard. Even though the problem is
computationally difficult, a large number of heuristics and exact methods are known, so
that some instances with tens of thousands of cities have been solved. The most direct

solution would be to try all permutations and see which one is cheapest (using brute force
search). The running time for this approach is O(V !), the factorial of the number of
cities, so this solution becomes impractical even for only 20 cities. A
dynamic programming solution solves the problem with a runtime complexity of O(V
22V ) by considering dp[end][state] which means the minimum cost to travel from start
vertex to end vertex using the vertrices stated in the state (start vertex can be any vertex
chosen at the start). As there are V 2V subproblems and the time complexity to solve
each sub-problems is O(V ), the overall runtime complexity O(V 22V ).

3.2 Vertex Coloring:

Vertex coloring is one of the most important concepts in graph theory and is used in
many real time applications in computer science. Various coloring methods are available
and can be used on requirement basis. The proper coloring of a graph is the coloring of
the vertices and edges with minimal number of colors such that no two vertices should
have the same color. The minimum number of colors is called as the chromatic number
and the graph is called properly colored graph.

8
4. Conclusion:
It is concluded that graph theory application helps a lot to present functionality and status of
many techniques with the help of vertex and edges.in computer science users can evaluate
functionalities of system with the help of graph diagrams of that system and can solve any
problem on that state where it need to be solved.