Noncommutative distances on graphs: An explicit approach via Birkhoff-James orthogonality
arXiv:2409.04146
Abstract
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.
26 pages, 1 figure