✦ LIBER ✦

Locating a robber on a graph via distance queries

✍ Scribed by Carraher, James; Choi, Ilkyoo; Delcourt, Michelle; Erickson, Lawrence H.; West, Douglas B.

Book ID: 118201153
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 262 KB
Volume: 463
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2012.06.035

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Locating a robber on a graph

✍ Suzanne Seager 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 200 KB

Locating a backtracking robber on a tree

✍ Seager, Suzanne 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 654 KB

Cops and Robber Game with a Fast Robber

Cops and Robber Game with a Fast Robber on Expander Graphs and Random Graphs

✍ Abbas Mehrabian 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 326 KB

A note on -cop, -robber games on graphs

✍ Geňa Hahn; Gary MacGillivray 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 186 KB

On distinct distance sets in a graph

✍ Xiaohui Lin; Minghua Zhu; Zhengguo Yu; Chengxue Zhang; Yuansheng Yang 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 182 KB

A distinct distance set (DD set) for a graph G is a vertex subset of G with the property that for ISI = s, we have (~) distinct distances of the pairs of vertices in S. In this article, it is shown that (a) For 6 ~< k ~< 18 there exists a tree T with DD(T) = k and din(T) = LB(k) < B~(Kk). where LB(

On the degree distance of a graph

✍ P. Dankelmann; I. Gutman; S. Mukwembi; H.C. Swart 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 373 KB