1 problem
Matching
Let be a symmetrically self-similar graph with bounded geometry, and let its Green's function be the generating function for walks on . A star is a graph consisting of finit…
Let be a symmetrically self-similar graph with bounded geometry, and let its Green's function be the generating function for walks on . A star is a graph consisting of finit…