A profile on a graph G is any nonempty multiset whose elements are vertices from G. The
corresponding remoteness function associates to each vertex x∈ V (G) the sum of distances
from x to the vertices in the profile. Starting from some nice and useful properties of the
remoteness function in hypercubes, the remoteness function is studied in arbitrary median
graphs with respect to their isometric embeddings in hypercubes. In particular, a relation
between the vertices in a median graph G whose remoteness function is maximum …

A profile on a graph G is any nonempty multiset whose elements are vertices from G. The
corresponding remoteness function associates to each vertex x 2 VG/the sum of distances
from x to the vertices in the profile. Starting from some nice and useful properties of the
remoteness function in hypercubes, the remoteness function is studied in arbitrary median
graphs with respect to their isometric embeddings in hypercubes. In particular, a relation
between the vertices in a median graph G whose remoteness function is maximum …