ETH Zürich » Computer Science » Theory » Cryptography

Publications: Abstract

Domination Search on Graphs with Low Dominating-Target-Number

Divesh Aggarwal and Shashank Mehta and Jitender Deogun

We settle two conjectures on domination-search, a game proposed by Fomin [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.