Domination search on graphs with low dominating-target-number

Authors:
Divesh Aggarwal;Shashank K. Mehta;Jitender S. Deogun
Affiliations:
Indian Institute of Technology, Kanpur, India;Indian Institute of Technology, Kanpur, India;University of nebraska-Lincoln, Lincoln, nE
Venue:
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Year:
2005

Citing 7
Cited 2

Searching for a mobile intruder in a polygonal region

SIAM Journal on Computing
Asteroidal Triple-Free Graphs

SIAM Journal on Discrete Mathematics
Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs

SIAM Journal on Computing
An algorithm for searching a polygonal region with a flashlight

Proceedings of the sixteenth annual symposium on Computational geometry
Dominating Pair Graphs

SIAM Journal on Discrete Mathematics
On the domination search number

Discrete Applied Mathematics
Hereditary dominating pair graphs

Discrete Applied Mathematics

An annotated bibliography on guaranteed graph searching

Theoretical Computer Science
Approximation algorithms for domination search

WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms

Quantified Score

Hi-index	0.00

Visualization

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.