Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
INTRODUCTION
Now a days Graph theory is playing a vital role in every branch of Science and Technology. Also it is
widely used in almost other fields like Sociology, Biology, biochemistry (genomics), Chemistry (for the study of
molecules, construction of bonds and for the study of atoms), Electrical engineering (communication networks
Original Article
Received: May 02, 2016; Accepted: May 23, 2016; Published: Jun 21, 2016; Paper Id.: IJMCARJUN201603
and coding theory), Computer Science (algorithms and computation) and operations research (scheduling) etc.
The most important concept of graph coloring is used in scheduling problems (final exams at a university or jobs
in a factory) and resource allocations. Also, paths, walks and circuits in graph theory are used in tremendous
applications say traveling salesman problem, concepts on database design, resource networking which leads to the
development of new algorithms and new theorems that can be used in various applications [1 & 5]. The edge
connectivity as well as vertex connectivity is used as graph theoretic tools to study traffic control problem at an
intersection.
Due to huge population and urbanization of small towns and cities, the increase in the number of vehicles
led to the increase in time losses of traffic participants, the increase of environmental and noise pollution leads to
the increasing number of traffic accidents. The major obstacle for the development of many urban areas is the
traffic congestion which is also affecting millions of people. The construction of new roads may improve the
situation, but it is very costly and in many cases it is impossible due to the existing structures. Instead of
constructing the new roads, the other way to control the traffic flow in such a situation is to use the current road
network in an efficient way. A methodology of handling city traffic in a very efficient way by proper traffic
management instead of modifying the road infrastructure was studied by Dave and Jhala [3]. This paper presents
the applications of vertex connectivity and edge connectivity in traffic control problems at an intersection so as to
minimize the waiting time of the traffic participants and the cost of locating the sensors for collecting the traffic
www.tjprc.org
editor@tjprc.org
30
Shakera Tanveer
FIRST EXAMPLE
The example considered is a traffic control problem at a four leg intersection, with four streams and the
corresponding compatibility graph as shown in Figures 1 & 2 below are from [3] and [4].
31
In the compatibility graph (Figure 2), number of vertices n is 4 and number of edges e is 4. The vertex
connectivity as well as edge connectivity is 2. The edges {b, c} and {a, b} corresponding to the edge connectivity as well
as vertices b and c corresponding to the vertex connectivity whose removal disconnects the compatibility graph.
The disconnected graphs having two components obtained after removing the edges {b, c} and {a, b} as well as vertices b
and c from the compatibility graph are shown below through the Figure 3 and Figure 4 respectively.
Figure 3: Graph obtained after Removal of the Edges {b, c} and {a, b}
SECOND EXAMPLE
Another example considered here is a traffic control problem with seven streams and the corresponding
compatibility graph as shown in Figures 5 & 6 below are from [3, 4] and [8].
www.tjprc.org
editor@tjprc.org
32
Shakera Tanveer
Figure 7: Graph obtained after Removal of the Edges {a, c}, {c, d}and {c, g}
APPLICATIONS
The edge connectivity and vertex connectivity have wide application in traffic control problems at an intersection.
The edges given by the edge connectivity and the vertices given by the vertex connectivity determine the exact locations
where the sensors have to be placed which minimizes the total cost and the complete data of the traffic problem can be
obtained by using either of the two connectivitys [2].
33
To study the properties of communication and transportation networks, these connectivitys are of great
importance due to its necessity in finding the maximum rate of flow that is possible from one node to another in the
network. There are many other applications in networks such as network representing roads with traffic capacities, or link
in a computer network with data transmission capacities, or currents in an electric network and also some application in
industrial settings etc.
CONCLUSIONS
In this paper few applications of graph theory are shown with examples. In particular the concept of vertex
connectivity and edge connectivity of a graph can have many different real-world applications and are also used as graph
theoretic tools to study traffic control problem at an intersection. The waiting time of the traffic participants can be
minimized by controlling the edges of the edge connectivity and can be achieved by placing traffic sensors on each such
edges of the edge connectivity of the transportation network which will provide complete information of the traffic
network. As an alternative to above, sensors can also be placed on each vertex of the vertex connectivity of the
transportation network for getting complete traffic information of the network. So, it is concluded that Graph Theory is an
incredibly important part of modern-day life.
REFERENCES
1.
Shamim Ahmed, (2012), Applications of Graph Coloring in modern computer science, Int. J. of Comp. Inf. Tech.,3(2) 1-7.
2.
Arun Kumar Baruah, (2014), Traffic control problems using graph connectivity, Int. J. of Comp. App., 86(11) 1-3.
3.
Darshankumar Dave and Nityangini Jhala, Application of Graph Theory in Traffic Management, Int. J. of Engg. and
Innovative Tech. Vol. 3(12) 2014, 124-126.
4.
Mohsen Hosseini, S. and Oroogi, H.(2009), Phasing of Traffic Lights at a Road Junction, Appl. Math. Sci., 3(30) 1487-1492
5.
Shirinivas, S.G. , Vetrivel, S. and Elango, M.,(2010), Applications of Graph Theory in computer Science review, Int. J. of
Engg. Sci. and Tech., 2(9) 4610-4621
6.
Guberinic, S., Senborn, G., Lazic, B. (2008), Optimal Traffic Control Urban Intersection, CRC Press.
7.
Deo, N., (2000), Graph Theory with Applications to Engineering and Computer Science, Prentice Hall Inc., New Jersey.
8.
Balakrishnan, R., Ranganathan, K. (2012), A text book of Graph Theory, Second Edition, Springer, New York.
www.tjprc.org
editor@tjprc.org