We investigate two types of query games played on a graph, pair queries and edge queries. We concentrate on investigating the two associated graph parameters for binomial random graphs, and showing that determining any of the two parameters is NP-hard for bounded degree graphs.

翻译：我们研究了在图上的两种查询博弈：对查询与边查询。重点分析了二项随机图对应的两个图参数，并证明对任意有界度图，确定这两个参数中的任意一个均为NP困难问题。