The K-spread resistance of graph

• 主要作者: Lapus, Raymond R.
• 格式: text
• 出版: Animo Repository 2010
• 主題: Probabilities; Mathematics
• 在線閱讀: https://animorepository.dlsu.edu.ph/faculty_research/7814
• 機構: De La Salle University

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....