منابع مشابه
Vertex-to-vertex pursuit in a graph
A graph G is given and two players, a cop and a robber, play the folioking game: the cop chooses a vertex, then the robber chooses a vertex, then the players move alternately beginning with the cop. A move consists of staying at one’s present vertex or moving to an adjacent vertex; each move is seen by both players. The cop wins if he manages to occupy the same vertex as the robber, and the rob...
متن کاملVertex Pursuit Games in Stochastic Network Models
Random graphs with given expected degrees G(w) were introduced by Chung and Lu so as to extend the theory of classical G(n, p) random graphs to include random power law graphs. We investigate asymptotic results for the game of Cops and Robber played on G(w) and G(n, p). Under mild conditions on the degree sequence w, an asymptotic lower bound for the cop number of G(w) is given. We prove that t...
متن کاملVertex-Pursuit in Hierarchical Social Networks
Hierarchical social networks appear in a variety of contexts, such as the on-line social network Twitter, the social organization of companies, and terrorist networks. We examine a dynamic model for the disruption of information flow in hierarchical social networks by considering the vertex-pursuit game Seepage played in directed acyclic graphs (DAGs). In Seepage, agents attempt to block the mo...
متن کاملVertex-Pursuit in Random Directed Acyclic Graphs
We examine a dynamic model for the disruption of information flow in hierarchical social networks by considering the vertex-pursuit game Seepage played in directed acyclic graphs (DAGs). In Seepage, agents attempt to block the movement of an intruder who moves downward from the source node to a sink. We propose a generalized stochastic model for DAGs with given expected total degree sequence. S...
متن کاملReconfiguration of Vertex Covers in a Graph
Suppose that we are given two vertex covers C 0 and C t of a graph G, together with an integer threshold k ≥ max{|C 0 | , |C t |}. Then, the vertex cover reconfiguration problem is to determine whether there exists a sequence of vertex covers of G which transforms C 0 into C t such that each vertex cover in the sequence is of cardinality at most k and is obtained from the previous one by either...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1983
ISSN: 0012-365X
DOI: 10.1016/0012-365x(83)90160-7