We discuss link and point deletion operators on graph games and provide a comparative logic-algorithmic study of the same. In particular, we focus on a popular notion of invariance in transition systems, namely, bisimulation, between the respective games on graphs. We present both logical and algorithmic analyses of the concepts so as to provide a more formal analysis of the natural connection between these two operators.
@article{arxiv.2104.09816,
title = {On link deletion and point deletion in games on graphs},
author = {Sujata Ghosh and Shreyas Gupta and Lei Li},
journal= {arXiv preprint arXiv:2104.09816},
year = {2021}
}