I'm having trouble finding any other references to a notion of a dimension of a graph which is based on howthe number of vertices which can be reached through a path of a given length increases with the length. I'm finding things like, a dimension of a graph as the minimum dimension of euclidean space where the vertices can be placed and have each edge have length 1, and another thing which seems closer which is base…
His definition also works better than euclidean dimension, e.g. for a grid on cylinder euclidean dimension will be 3 and his definition will give 2. I think a modification of the definition above to allow minimum dimension of non-euclidean space will be same as Wolframs definition for the cases when dimension of the graph is not fractional number.