𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A search game on the union of graphs with immobile hider

✍ Scribed by Ljiljana Pavlović

Publisher
John Wiley and Sons
Year
1995
Tongue
English
Weight
623 KB
Volume
42
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A probabilistic local majority polling g
A probabilistic local majority polling game on weighted directed graphs with an application to the distributed agreement problem
✍ Toshio Nakata; Hiroshi Imahayashi; Masafumi Yamashita 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 123 KB 👁 1 views

In this paper, we investigate a probabilistic local majority polling game on weighted directed graphs, keeping an application to the distributed agreement problem in mind. We formulate the game as a Markov chain, where an absorbing state corresponds to a system configuration that an agreement is ach

On the size of graphs labeled with a con
On the size of graphs labeled with a condition at distance two
✍ Georges, John P.; Mauro, David W. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 595 KB

A labeling of graph G with a condition at distance two is an integer labeling of V(G) such that adjacent vertices have labels that differ by at least two, and vertices distance two apart have labels that differ by a t least one. The lambda-number of G, A(G), is the minimum span over all labelings of

On a random graph with immigrating verti
On a random graph with immigrating vertices: Emergence of the giant component
✍ David J. Aldous; Boris Pittel 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 186 KB 👁 2 views

A randomly evolving graph, with vertices immigrating at rate n and each possible edge appearing at rate 1/n, is studied. The detailed picture of emergence of giant components with O n 2/3 vertices is shown to be the same as in the Erdős-Rényi graph process with the number of vertices fixed at n at t

On the Density of Subgraphs in a Graph w
On the Density of Subgraphs in a Graph with Bounded Independence Number
✍ Pavel Valtr 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 260 KB

Let \_(n, m, k) be the largest number \_ # [0, 1] such that any graph on n vertices with independence number at most m has a subgraph on k vertices with at lest \_ } ( k 2 ) edges. Up to a constant multiplicative factor, we determine \_(n, m, k) for all n, m, k. For log n m=k n, our result gives \_(

A lower bound on the order of regular gr
A lower bound on the order of regular graphs with given girth pair
✍ C. Balbuena; T. Jiang; Y. Lin; X. Marcote; M. Miller 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 129 KB 👁 1 views

## Abstract The girth pair of a graph gives the length of a shortest odd and a shortest even cycle. The existence of regular graphs with given degree and girth pair was proved by Harary and Kovács [Regular graphs with given girth pair, J Graph Theory 7 (1983), 209–218]. A (δ, __g__)‐cage is a small