Multiple Intruder Locating Dominating Sets

K. Venugopal¹ , K. A. Vidya²

Section:Research Paper, Product Type: Isroset-Journal
Vol.6 , Issue.2 , pp.394-398, Apr-2019

CrossRef-DOI:   https://doi.org/10.26438/ijsrmss/v6i2.394398

Online published on Apr 30, 2019

Copyright © K. Venugopal, K. A. Vidya . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
 

View this paper at   Google Scholar | DPI Digital Library

XML View     PDF Download

How to Cite this Paper

388 Views    264 Downloads    141 Downloads

Abstract :
Safeguarding of facilities has been at a major focus in graph theoretical research which has led to a surge of various parameters of locating dominating sets in graphs. However, in all those parameters, a single intruder is assumed to be present in a network. In this paper, we introduce Multiple Intruder Locating Dominating (MILD) sets where one is interested in finding the presence as well as the locations of intruders at multiple (possibly all) locations in a network. The number of vertices in the smallest MILD set of a graph G is called its MILD number, denoted by MILD(G). For a simple connected graph of order n, the MILD number lies between n/2 and n-1, both inclusive. The graphs which attain these bounds are characterized.

Key-Words / Index Term :
Domination, Locating Domination, Multiple intruder locating domination

References :
[1] B. Chaluvaraju, K. A. Vidya, “Generalized perfect domination in graphs”, Journal of Combinatorial Optimization, Vol.27, Issue.2, pp.292-301, 2014.
[2] E. J. Cockayne, R. M. Dawes, S. T. Hedetniemi, “Total domination in graphs”, Networks, Vol.10, Issue3, pp.211-219, 1980.
[3] Frank Harary, “Graph theory”, Narosa Publications, 1988.
[4] T. W. Haynes, S. T. Hedetniemi, P. J. Slater, “Fundamentals of domination in graphs”, CRC Press, 1998.
[5] T. W. Haynes, S. T. Hedetniemi, P. J. Slater, “Domination in graphs: advanced topics”, Monographs and textbooks in pure and applied mathematics, Vol.209, 1998.
[6] S. J. Seo, P. J. Slater, “Open neighborhood locating-dominating sets”, Australasian Journal of Combinatorics, Vol.46, pp.109-120, 2010.
[7] S. J. Seo, P. J. Slater, “Open-independent, open-locating-dominating sets”, Electronic Journal of Graph Theory and Applications, Vol.5, Issue 2, pp.179-193, 2017.
[8] P. J. Slater, “Domination and location in acyclic graphs”, Networks, Vol.17, pp.55–64, 1987.
[9] P. J. Slater, “Dominating and reference sets in a graph”, Journal of Mathematical and Physical Sciences, Vol.22, pp.445–455, 1988.
[10] P. J. Slater, “Locating dominating sets and locating-dominating sets”, Graph Theory, Combinatorics and Applications: Proceedings of the Seventh Quadrennial International Conference on the Theory and Applications of Graphs, Vol.2, pp.1073-1079, 1995.
[11] P. J. Slater, “Fault-tolerant locating-dominating sets”, Discrete Mathematics, Vol.249, Issue 1-3, pp.179-189, 2002.
[12] D. K. Thakkar, S.M. Badiyani, "Independent Roman Domination Number of Graphs", International Journal of Scientific Research in Mathematical and Statistical Sciences, Vol.5, Issue.2, pp.29-34, 2018
[13] D. B. West, “Introduction to graph theory”, Prentice hall Upper Saddle River, 2001.