The Djoković-Winkler relation Θ is a binary relation defined on the edge set of a given graph that is based on the distances of certain vertices and which plays a prominent role in graph theory. In this paper, we explore the relatively uncharted “reflexive complement” Θ‾ of Θ, where (e,f)∈Θ‾ if and only if e=f or (e,f)∉Θ for edges e and f. We establish the relationship between Θ‾ and the set Δef, comprising the distances between the vertices of e and f and shed some light on the intricacies of its transitive closure ⁎Θ‾⁎. Notably, we demonstrate that ⁎Θ‾⁎ exhibits multiple equivalence classes only within a restricted subclass of complete multipartite graphs. In addition, we characterize non-trivial relations R that coincide with Θ‾ as those where the graph representation is disconnected, with each connected component being the (join of) Cartesian product of complete graphs. The latter results imply, somewhat surprisingly, that knowledge about the distances between vertices is not required to determine ⁎Θ‾⁎. Moreover, ⁎Θ‾⁎ has either exactly one or three equivalence classes.