
























It is proved that the number of shortest paths between two vertices of distance $t$ in a graph with degrees bounded by $Δ$ is at most $2 \cdot (\fracΔ{2})^t$. This improves upon the naïve $Δ(Δ-1) ^{t-1}$ bound.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。