The K-spread resistance of graph
Let G = (V, E) be a finite, nontrivial and loopless graph. We define the spread process in recursive manner. At the start of the process; i.e., k = 0, we assume s ∈ V is labelled. We set t ∈ V \ { s} to be our target vertex. Suppose A ⊆ V is a nonempty set of labelled vertices at time step k > 0....
Saved in:
| Main Author: | |
|---|---|
| Format: | text |
| Published: |
Animo Repository
2010
|
| Subjects: | |
| Online Access: | https://animorepository.dlsu.edu.ph/faculty_research/7814 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | De La Salle University |