Graph Odometry
Combinatorics
2012-11-12 v1 Discrete Mathematics
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.
Keywords
Cite
@article{arxiv.1211.2151,
title = {Graph Odometry},
author = {Aaron Dutle and Bill Kay},
journal= {arXiv preprint arXiv:1211.2151},
year = {2012}
}
Comments
14 pages, 5 figures