On the st-spread resistance of a graph
Let G = (V, E) be an undirected nontrivial loopless graph with possible parallel edges. We presuppose that the vertex s in G is labelled at initial lime step and that every labelled vertex spreads its labelling to neighbouring vertices with infection probability p in one time step. In this paper, we...
Saved in:
Main Author: | Lapus, Raymond R. |
---|---|
Format: | text |
Published: |
Animo Repository
2010
|
Subjects: | |
Online Access: | https://animorepository.dlsu.edu.ph/faculty_research/7816 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | De La Salle University |
Similar Items
-
On the st-spreading resistance of networks
by: Lapus, Raymond R.
Published: (2010) -
On the lower bound for the spread process in a graph
by: Lapus, Raymond R.
Published: (2010) -
The aggregate of a graph
by: Lapus, Raymond R.
Published: (2007) -
The D-weight of a graph
by: Lapus, Raymond R.
Published: (2007) -
The K-spread resistance of graph
by: Lapus, Raymond R.
Published: (2010)