Noncommutative distances on graphs: An explicit approach via Birkhoff-James orthogonality

We study the problem of calculating noncommutative distances on graphs, using techniques from linear algebra, specifically, Birkhoff-James orthogonality. A complete characterization of the solutions is obtained in the case when the underlying graph is a path.