Volume : 2 | Issue : 3 | March 2013 ISSN - 2250-1991

Research Paper Engineering

Domination in Graph with Application

* Preeti Gupta
* Department of Engg. Mathematics, Prestige Institute of Engineering and Science, Indore, INDIA
ABSTRACT

The paper concentrates on the domination in graphs with application In a graph G = (V, E ), S V is a dominating set of G if
every vertex is either in S or joined by an edge to some vertex in S. Many different types of domination have been researched
extensively this paper explores applications of dominating sets.
2000 Mathematics Subject classification: 05C69, 05C99

Keywords: Domination Set.

1. INTRODUCTION ingful sub areas, placing the study of dominating sets in even
Domination in graphs has been an extensively researched
branch of graph theory. Graph theory is one of the most
flourishing branches of modern mathematics and computer
applications. The last 30 years have witnessed spectacular
growth of Graph theory due to its wide applications to discrete
optimization problems, combinatorial problems and classical
algebraic problems. It has a very wide range of applications
to many fields like engineering, physical, social and biologi-
cal sciences; linguistics etc., the theory of domination has
been the nucleus of research activity in graph theory in re-
cent times. This is largely due to a variety of new parameters
that can be developed from the basic definition of domina-
tion. The NP-completeness other basic domination problems
and its close relationship to other NP-completeness problems
have contributed to the enormous growth of research activity
in domination theory. It is clearly established from the exclu-
sive coverage of the Topics on domination in graph in the
86th issue of the Journal of Discrete mathematics (1990),
that the theory of domination is a very popular area for re-
search activity in graph theory. The rigorous study of domi-
nating sets in graph theory began around 1960, even though
the subject has historical roots dating back to 1862 when de
Jaenisch studied the problems of determining the minimum
number of queens which are necessary to cover or dominate
a n x n chessboard. In 1958, Berge defined the concept of
the domination number of a graph, calling this as coefficient
of External Stability. In 1962, Ore used the name dominat-
ing set and domination number for the same concept. In
1977 Cockayne and Hedetniemi made an interesting and ex-
tensive survey of the results know at that time about dominat-
ing sets in graphs. They have used the notation (G) for the
domination number of a graph, which has become very popu-
lar since then. The survey paper of Cockayane and Hedet-
niemi has generated lot of interest in the study of domination
in graphs. In a span of about twenty years after the survey,
more than 1,200 research papers have been published on
this topic, and the number of papers continued to be on then
crease. Since then a number of graph theorists Konig, Ore,
Bauer, Harary, Lasker, Berge, Cockayne, Hedetniemi, Alavi,
Allan, Chartrand, Kulli, Sampthkumar, Walikar, Armugam,
Acharya, Neeralgi, Nagaraja Rao, Vangipuram many others
have done very interesting and significant work in the domi-
nation numbers and the other related topics. Recent book on
domination [3], has stimulated sufficient inspiration leading
to the expansive growth of this field of study. It has also put
some order into this huge collection of research papers, and
organized the study of dominating sets in graphs into mean-
broader mathematical and algorithmic contexts. Vasumathi &
Vangipuram[8] and Vijayasaradhi & Vangipuram [9] obtained
domination parameters of an arithmetic Graph and also they
have obtained an elegant method for the construction of a
arithmetic graph with the given domination parameter. In most
of the researches in Graph theory, the investigators are con-
tent with establishing the existence of a graph with a given
graphical parameter. For example, given domination number
as n does there exist a graph with this as the domination num-
ber? Similarly does there exist a graph with given bondage
number or with given domatic number? These problems have
been investigated successfully. However in the matter of ap-
plications of these results to real life situations it becomes
necessary to evolve the method of constructing such a graph
with a given parameter. Construction of a graph with a given
Graph theoretic parameter is generally difficult by the usual
graph theoretic methods. In many applications of domination
number, bondage number, or domatic number, it becomes
necessary to construct a graph with as few vertices and/or
edges as possible with a given domination number or bond-
age number or domatic number. It is in this context the us-
age of elementary number theoretic principles will help in the
constructions of such graphs. In Vasumathi and Vangipuram
[8], the construction of a graph with a given domination num-
ber has been given, using such a method. A similar method
of construction using again elementary principles of number
theory helped in the construction of a graph with a graceful
degree sequence by Vijayasaradhi and Vangipuram [9].
2. Applications of Domination in Graph
Domination in graphs has applications to several fields. Domi-
nation arises in facility location problems, where the number
of facilities (e.g., hospitals, fire stations) is fixed and one at-
tempts to minimize the distance that a person needs to travel
to get to the closest facility. A similar problem occurs when
the maximum distance to a fality is fixed and one attempts to
minimize the number of facilities necessary so that everyone
is serviced. Concepts from domination also appear in prob-
lems involving finding sets of representatives, in monitoring
communication or electrical networks, and in land surveying
(e.g., minimizing the number of places a surveyor must stand
in order to take height measurements for an entire region).
2.1 School Bus Routing:
Most school in the country provide school buses for transport-
ing children to and from school Most also operate under cer-
tain rules, one of which usually states that no child shall have

PARIPEX - INDIAN JOURNAL OF RESEARCH X 115

Volume : 2 | Issue : 3 | March 2013
to walk farther than, say one quarter km to a bus pickup point.
Thus, they must construct a route for each bus that gets with-
in one quarter km of every child in its assigned area. No bus
ride can take more than some specified number of minutes,
and Limits on the number of children that a bus can carry at
any one time. Let us say that the following figure represents
a street map of part of a city, where each edge represents
one pick up block. The school is located at the large vertex.
Let us assume that the school has decided that no child shall
have to walk more than two blocks in order to be picked up by
a school bus. Construct a route for a school bus that leaves
the school, gets within two blocks of every child and returns
to the school.
2.2 Computer Communication Networks:
Consider a computer network modeled by a graph G = (V,E),
for which vertices represents computers and edges represent
direct links between pairs of computers. Let the vertices in
following figure represent an array, or network, of 16 com-
puters, or processors. Each processor to which it is directly
connected. Assume that from time to time we need to collect
information from all processors. We do this by having each
processor route its information to one of a small set of collect-
ing processors (a dominating set). Since this must be done
relatively fast, we cannot route this information over too long
a path. Thus we identify a small set of processors which are
close to all other processors. Let us say that we will tolerate
at most a two unit delay between the time a processor sends
its information and the time it arrives at a nearby collector. In
this case we seek a distance-2 dominating set among the set
of all processors. The two shaded vertices form a distance-2
dominating set in the hypercube network in following figure
2.3 Radio Stations:
Suppose that we have a collection of small villages in a re-
mote part of the world. We would like to locate radio stations
in some of these villages so that messages can be broadcast
to all of the villages in the region. Since each radio station has
a limited broadcasting range, we must use several stations to
reach all villages. But since radio stations are costly, we want
to locate as few as possible which can reach all other villages.
Let each village be represented by a vertex. An edge between
two villages is labeled with the distance, say in kilometers,
between the two villages
116 X PARIPEX - INDIAN JOURNAL OF RESEARCH
ISSN - 2250-1991
Let us assume that a radio station has a broadcast range of
fifty kilometers. What is the least number of stations in a set
which dominates (within distance 50) all other vertices in this
graph? A set (B, F, H,J} of cardinality four is indicated in the
following figure(b).
Here we have assumed that a radio station has a broadcast
range of only fifty kilometers, we can essentially remove all
edges in the graph, which represent a distance of more than
fifty kilometers. We need only to find a dominating set in this
graph. Notice that if we could afford radio stations which have
a broadcast range of seventy kilometers, three radio stations
would sufficient.
2.4 Locating Radar Stations Problem
The problem was discussed by Berge . A number of strategic
locations are to be kept under surveillance. The goal is to
locate a radar for the surveillance at as few of these locations
as possible. How a set of locations in which the radar stations
are to be placed can be determined.
2.5 Nuclear Power Plants Problem
z similar known problem is a nuclear power plants problem.
There are various locations and an arc can be drawn from lo-
cation x to location y if it is possible for a watchman stationed
at x to observe a warning light located at y. How many guards
are needed to observe all of the warning lights, and where
should they be located?
At present, domination is considered to be one of the funda-
mental concepts in graph theory and its various applications
to ad hoc networks, biological networks, distributed comput-
ing, social networks and web graphs [1, 25, 27, 47] partly
explain the increased interest. Such applications usually aim
to select a subset of nodes that will provide some definite
service such that every node in the network is close to some
node in the subset. The following examples show when the
concept of domination can be applied in modeling real-life
problems.
2.6 Modeling Biological Networks
Using graph theory as a modeling tool in biological networks
allows the utilization of the most graphical invariants in such
a way that it is possible to identify secondary RNA (Ribonu-
cleic acid) motifs numerically. Those graphical invariants are
variations of the domination number of a graph. The results
Volume : 2 | Issue : 3 | March 2013 ISSN - 2250-1991

of the research carried out in show that the variations of the
domination number can be used for correctly distinguishing
among the trees that represent native structures and those
that are not likely candidates to represent RNA.
2.7 Modeling Social Networks
Dominating sets can be used in modeling social networks and
studying the dynamics of relations among numerous individu-
als in different domains. A social network is a social structure
made of individuals (or groups of individuals), which are con-
nected by one or more specific types of interdependency. The
choice of initial sets of target individuals is an important prob-
lem in the theory of social networks. In the work of Kelleher
and Cozzens, social networks are modeled in terms of graph
theory and it was shown that some of these sets can be found
by using the properties of dominating sets in graphs.
2.8 Facility Location Problems
The dominating sets in graphs are natural models for facil-
ity location problems in operational research. Facility loca-
tion problems are concerned with the location of one or more
facilities in a way that optimizes a certain objective such as
minimizing transportation cost, providing equitable service to
customers and capturing the largest market share.
2.9 Coding Theory
The concept of domination is also applied in coding theory as
discussed by Kalbfleisch, Stanton and Horton and Cockayne
and Hedetniemi . If one defines a graph, the vertices of which
are the n-dimensional vectors with coordi- nates chosen from
{1,..., p}, p > 1, and two vertices are adjacent if they differ
in one coordinate, then the sets of vectors which are (n, p)-
covering sets, single error correcting codes, or perfect cover-
ing sets are all dominating sets of the graph with determined
additional properties.
2.10 Multiple Domination Problems
An important role is played by multiple domination. Multiple
domination can be used to construct hierarchical overlay
networks in peer-to-peer applications for more efficient index
searching. The hierarchical overlay networks usually serve
as distributed databases for index searching, e.g. in modern
file sharing and instant messaging computer network applica-
tions. Dominating sets of several kinds are used for balanc-
ing efficiency and fault tolerance as well as in the distributed
construction of minimum spanning trees. Another good exam-
ple of direct, important and quickly developing applications of
multiple domination in modern computer networks is a wire-
less sensor network.
3. Conclusion:
The main aim of this paper is to present the importance of
graph theoretical ideas in various areas of Science & Engi-
neering for researches that they can use Domination in graph
theoretical concepts for the research. An overview is present-
ed especially to project the idea of graph theory. So, the graph
theory section of each paper is given importance than to the
other sections. Researches may get some information related
to graph theory and its applications in various field and can
get some ideas related to their field of research.

REFERENCES
[1] Bollobas.B, Graph Theory: An Introductory Course Springer 1979. | [2] Bondy and Murty: Graph theory with applications, Macmillan (1976). | [3] Haynes, T.W.,
Hedetniemi, S.T. and Slater, P.J., Fundamentals of domination in graphs; Marcel Dekkar, Inc-New York (1998). | [4] Harary, F., Graph Theory, Addison Wesley, Mas-
sachusetts, (1969). | [5]. J. Wilson and J.J. Watkins John, Graphs: An Introductory Approach, Wiley & Sons 1990. | [6] Laskar, R.C. and Walikar, H.B., On domination
related concepts in graph theory, in : Lecture in Match., 885 (1981), 308-320. | [7] Sampathkumar, E., On some new domination parameters of a graph A Survey,
Proceedings of a symposium on graph theory and combinatorics, Kochi, Kerala, India, 17-19 may 1991, pp. 7-13. | [8] Vasumathi, N., and Vangipuram, S., Existence of
a graph with a given domination parameter | Proceedings of the Fourth Ramanujan Symposium on Algebra and its Applications; University of Madras, Madras, 187-195
(1995). | [9] Vijaya Saradhi and Vangipuram: Irregular graphs. Graph Theory Notes of New York, Vol. 41, 2001, pp. 33-36. | [10] Chatrand, G., and Lesniak, L., Graphs
and digraphs, Chapman and Hall, Madras (1996). | [11] Cockayne, E.J., and Hedetniemi, S.T., towards a theory of domination in graphs, Networks, fall (1977), 247-271.
| [12] Cockayne, E.J., Domination of undirected graphs, A survey, Lecture notes in Math., 642 (1978), 141-147. | [13] Cockayne, E.J., Dawes, R.W. and Hedetniemi,
S.T., Total domination in graphs, Networks, 10, (1980),

PARIPEX - INDIAN JOURNAL OF RESEARCH X 117