Abstract
We settle two conjectures on domination-search, a game proposed by Fomin et.al. [1], one in affirmative and the other in negative. The two results presented here are (1) domination search number can be greater than domination-target number, (2) domination search number for asteroidal-triple-free graphs is at most 2.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Fomin, F.V., Kratsch, D., Muller, H.: On the domination search number. Discrete Applied Mathematics 127, 565–580 (2003)
Bienstock, D.: Graph searching, path-width, tree-width and related problems (a survey). Discrete Mathematics and Theoretical Computer Science 5, 33–49 (1991)
Suzuki, I., Yamashita, M.: Searching for a mobile intruder in a polygonal region. SIAM Journal of Computing 21, 863–888 (1992)
Guibas, L., Latombe, J., Lavalle, S., Lin, D., Motwani, R.: A visibility based pursuit evasion problem. International Journal of Computational Geometry and Applications 9, 471–493 (1999)
Lavalle, S., Simov, B.H., Slutzki, G.: An algorithm for searching a polygonal region with flash light. In: Proceedings of the 16th annual symposium on computational geometry, pp. 260–269 (2000)
Crass, D., Suzuki, I., Yamashita, M.: Searching for a mobile intruder in a corridor-the open edge variant of the polygon search problem. International Journal of Computational Geometry and Applications 5, 397–412 (1995)
Lee, J.H., Park, S., Chwa, K.: Searching a polygonal room with one door by a 1-searcher. International Journal of Computational Geometry and Applications 10, 201–220 (2000)
Kloks, T., Kratsch, D., Muller, H.: On the structure of graphs with bounded asteroidal number. Graphs and Combinatorics 17, 295–306 (2001)
Corneil, D.G., Olariu, S., Stewart, L.K.: Asteroidal triple-free graphs. SIAM Journal of Discrete Mathematics 10, 399–430 (1997)
Corneil, D.G., Olariu, S., Stewart, L.K.: Linear time algorithms for dominating pairs in asteroidal triple-free graphs. SIAM Journal of Computing 28, 1284–1297 (1999)
Kloks, T., Kratsch, D., Muller, H.: Approximating the bandwidth of asteroidal triple-free graphs. Journal of Algorithms 32, 41–57 (1999)
Brandstadt, A., Le, V., Spinrad, J.: SIAM Monograph on Discrete Mathematics and Applications. Society for Industrial and Applied Mathematics (1999)
Deogun, J.S., Kratsch, D.: Dominating pair graphs. SIAM Journal of Discrete Mathematics 15, 353–366 (2002)
Przulj, N., Corneil, D.G., Kohler, E.: Hereditary dominating pair graphs. Discrete Applied Mathematics 134, 239–261 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aggarwal, D., Mehta, S.K., Deogun, J.S. (2005). Domination Search on Graphs with Low Dominating-Target-Number. In: Kratsch, D. (eds) Graph-Theoretic Concepts in Computer Science. WG 2005. Lecture Notes in Computer Science, vol 3787. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11604686_3
Download citation
DOI: https://doi.org/10.1007/11604686_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31000-6
Online ISBN: 978-3-540-31468-4
eBook Packages: Computer ScienceComputer Science (R0)