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

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.

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

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 Here we have assumed that a radio station has a broadcast
processor route its information to one of a small set of collect- range of only fifty kilometers, we can essentially remove all
ing processors (a dominating set). Since this must be done edges in the graph, which represent a distance of more than
relatively fast, we cannot route this information over too long fifty kilometers. We need only to find a dominating set in this
a path. Thus we identify a small set of processors which are graph. Notice that if we could afford radio stations which have
close to all other processors. Let us say that we will tolerate a broadcast range of seventy kilometers, three radio stations
at most a two unit delay between the time a processor sends would sufficient.
its information and the time it arrives at a nearby collector. In
this case we seek a distance-2 dominating set among the set 2.4 Locating Radar Stations Problem
of all processors. The two shaded vertices form a distance-2 The problem was discussed by Berge . A number of strategic
dominating set in the hypercube network in following figure 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
2.3 Radio Stations: to select a subset of nodes that will provide some definite
Suppose that we have a collection of small villages in a re- service such that every node in the network is close to some
mote part of the world. We would like to locate radio stations node in the subset. The following examples show when the
in some of these villages so that messages can be broadcast concept of domination can be applied in modeling real-life
to all of the villages in the region. Since each radio station has problems.
a limited broadcasting range, we must use several stations to
reach all villages. But since radio stations are costly, we want 2.6 Modeling Biological Networks
to locate as few as possible which can reach all other villages. Using graph theory as a modeling tool in biological networks
allows the utilization of the most graphical invariants in such
Let each village be represented by a vertex. An edge between a way that it is possible to identify secondary RNA (Ribonu-
two villages is labeled with the distance, say in kilometers, cleic acid) motifs numerically. Those graphical invariants are
between the two villages variations of the domination number of a graph. The results

116 X PARIPEX - INDIAN JOURNAL OF RESEARCH

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

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