Centroidal localization game

zbMath1406.05068arXiv1711.08836MaRDI QIDQ668034

Nicolas Nisse, Jarosław Grytczuk, Przemysław Gordinowicz, Joanna Sokół, Małgorzata Śleszyńska-Nowak, Bartłomiej Bosek

Publication date: 5 March 2019

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1711.08836

zbMATH Keywords

outerplanar graphsgraph searchingcops and robber

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (9)

Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters ⋮ The one-visibility localization game ⋮ The localization game on oriented graphs ⋮ Edge and pair queries-random graphs and complexity ⋮ The localization number of designs ⋮ The localization game on Cartesian products ⋮ Sequential metric dimension ⋮ Localization game for random graphs ⋮ The localization capture time of a graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds.
• Locating a robber on a graph
• Localization game on geometric and planar graphs
• Locating a robber on a graph via distance queries
• Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity
• A robber locating strategy for trees
• Locating a robber with multiple probes
• Locating a backtracking robber on a tree
• Domination and location in acyclic graphs
• On a new class of codes for identifying vertices in graphs
• Centroidal bases in graphs

This page was built for publication: Centroidal localization game