Graph Odometry
classification
🧮 math.CO
cs.DM
keywords
graphweightsedgeminimumvertexwalksaddressclosed
read the original abstract
We address problem of determining edge weights on a graph using non-backtracking closed walks from a vertex. We show that the weights of all of the edges can be determined from any starting vertex exactly when the graph has minimum degree at least three. We also determine the minimum number of walks required to reveal all edge weights.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.