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 |
| id |
oai:animorepository.dlsu.edu.ph:faculty_research-8531 |
|---|---|
| record_format |
eprints |
| spelling |
oai:animorepository.dlsu.edu.ph:faculty_research-85312022-11-18T06:13:50Z On the lower bound for the spread process in a graph Lapus, Raymond R. 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. 2010-01-01T08:00:00Z text https://animorepository.dlsu.edu.ph/faculty_research/7815 Faculty Research Work Animo Repository Graph theory Mathematics |
| institution |
De La Salle University |
| building |
De La Salle University Library |
| continent |
Asia |
| country |
Philippines Philippines |
| content_provider |
De La Salle University Library |
| collection |
DLSU Institutional Repository |
| topic |
Graph theory Mathematics |
| spellingShingle |
Graph theory Mathematics Lapus, Raymond R. On the lower bound for the spread process in a graph |
| description |
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. |
| format |
text |
| author |
Lapus, Raymond R. |
| author_facet |
Lapus, Raymond R. |
| author_sort |
Lapus, Raymond R. |
| title |
On the lower bound for the spread process in a graph |
| title_short |
On the lower bound for the spread process in a graph |
| title_full |
On the lower bound for the spread process in a graph |
| title_fullStr |
On the lower bound for the spread process in a graph |
| title_full_unstemmed |
On the lower bound for the spread process in a graph |
| title_sort |
on the lower bound for the spread process in a graph |
| publisher |
Animo Repository |
| publishDate |
2010 |
| url |
https://animorepository.dlsu.edu.ph/faculty_research/7815 |
| _version_ |
1767196765881106432 |