搜索结果: 1-2 共查到“理学 1-dimensional graphs”相关记录2条 . 查询时间(0.234 秒)
A set $W\subseteq V(G)$ is called a resolving set, if for each two distinct vertices $u,v\in V(G)$ there exists $w\in W$ such that $d(u,w)\neq d(v,w)$, where $d(x,y)$ is the distance between the verti...
Asymptotics of first-passage percolation on 1-dimensional graphs
Asymptotics of first-passage percolation 1-dimensional graphs Probability
2011/9/2
Abstract: In this paper we consider standard first-passage percolation on certain 1-dimensional periodic graphs. One such graph of particular interest is the $\Z\times\{0,1,...,K-1\}^{d-1}$ nearest ne...