On the lower bound for the spread process in a graph
Let G = (V, E) be a finite, nontrivial and loopless graph. We assume that s ∈ V is labelledat the start of the process. This label independently propagates along the edges of G to the neighbouring vertices in one discrete time step with the probability p. Define Tst(G) to be the expected time that t...
Saved in:
| Main Author: | |
|---|---|
| Format: | text |
| Published: |
Animo Repository
2010
|
| Subjects: | |
| Online Access: | https://animorepository.dlsu.edu.ph/faculty_research/7815 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | De La Salle University |
| Summary: | Let G = (V, E) be a finite, nontrivial and loopless graph. We assume that s ∈ V is labelledat the start of the process. This label independently propagates along the edges of G to the neighbouring vertices in one discrete time step with the probability p. Define Tst(G) to be the expected time that the process of spreading the label reaches the target vertex t for the first time. In this talk, we propose a lower bound for Tst(G) in terms of the reliability polynomial of G. |
|---|