Digital metrics generated by families of paths Original Research Article

Relationships between properties of a family of paths on a graph and properties of the distance function defined by the family are studied. Types of properties which lead to the distance function being a metric are considered. The study is a response to a query by Melter and Rosenfeld about possible generalizations of their s-connections. An application to metrics on sets of interlocking sublattices is given.