1 paper · 1 filter
William Dudarov, Noah Feinberg, Raymond Guo +5
Let G=(V,E) be a finite, simple, connected, combinatorial graph on n vertices and let D∈Rn×n be its graph distance matrix Dij=d(vi,vj). Stein…