Abstract
Abstract
A new way of analyzing permutation distance preserving mappings is presented by making use of a graph representation. The properties necessary to make such graphs distance-preserving and how this
relates to the total sum of distances that exist for such mappings, are investigated. This new knowledge is used to analyze previous constructions, as well as showing the existence or non-existence of
simple algorithms for mappings attaining the upper bound on the sum of distances. Finally, two applications for such graphs are considered.