✦ LIBER ✦

Cops and robbers in graphs with large girth and Cayley graphs

✍ Scribed by Peter Frankl

Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 243 KB
Volume: 17
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(87)90033-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

UniquelyH-colorable graphs with large gi

UniquelyH-colorable graphs with large girth

✍ Zhu, Xuding 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 498 KB 👁 2 views

Suppose G and H are graphs. We say G is H-colorable if there is a homomorphism (edge-preserving vertex mapping) from G to H. We say a graph G is uniquely H-colorable if there is an onto homomorphism c from G to H, and any other homomorphism from G to H is the composition o o c of c with an automorph

A game of cops and robbers played on pro

A game of cops and robbers played on products of graphs

✍ S. Neufeld; R. Nowakowski 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 825 KB

The game of cops and robbers is played with a set of 'cops' and a 'robber' who occupy some vertices of a graph. Both sides have perfect information and they move alternately to adjacent vertices. The robber is captured if at least one of the cops occupies the same vertex as the robber. The problem i

Large Cayley graphs and vertex-transitiv

Large Cayley graphs and vertex-transitive non-Cayley graphs of given degree and diameter

✍ Heather Macbeth; Jana Šiagiová; Jozef Širáň; Tomáš Vetrík 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 128 KB

## Abstract For any __d__⩾5 and __k__⩾3 we construct a family of Cayley graphs of degree __d__, diameter __k__, and order at least __k__((__d__−3)/3)^__k__^. By comparison with other available results in this area we show that our family gives the largest currently known Cayley graphs for a wide ra

Computing independent sets in graphs wit

Computing independent sets in graphs with large girth

✍ Owen J. Murphy 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 377 KB

Extraconnectivity of graphs with large m

Extraconnectivity of graphs with large minimum degree and girth

✍ C. Balbuena; A. Carmona; J. Fàbrega; M.A. Fiol 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 824 KB

Domination number of cubic graphs with l

Domination number of cubic graphs with large girth

✍ Daniel Král'; Petr Škoda; Jan Volec 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 219 KB

We show that every n-vertex cubic graph with girth at least g have domination number at most 0.299871n+O(n / g) < 3n / 10+O(n / g) This research was done when the Petr Škoda was a student of