In this paper such a characterization is obtained for the two classes of graphs on which the antimedian is well-behaved: paths and hypercubes. Keywords: ...

An antimedian of a profile π = (x1, x2, …, xk) of vertices of a graph G is a vertex maximizing the sum of the distances to the elements of the profile.

In this paper such a characterization is obtained for the two classes of graphs on which the antimedian iswell-behaved: paths and hypercubes. ResearchGate ...

Sep 21, 2012 · In this paper such a characterization is obtained for two classes of graphs on which the antimedian is well behaved: paths and hypercubes.

An antimedian of a profile π = (x1, x2, …, xk) of vertices of a graph G is a vertex maximizing the sum of the distances to the elements of the profile.

The antimedian function is defined on the set of all profiles on $G$ and has as output the set of antimedians of a profile. It is a typical location function ...

Sep 10, 2017 · A median (antimedian) of a profile of vertices on a graph G is a vertex that minimizes (maximizes) the sum of the distances to the elements ...

Balakrishnan, K., Changat, M., Mulder, H.H. and Subhamathi, A.R. (2012) Axiomatic Characterization of the Antimedian Function on Paths and Hypercubes.

Axiomatic Characterization of the Antimedian Function on Paths and Hypercubes. Kannan, Balakrishnan; Manoj, Changat; Henry, Martyn Mulder; Ajitha, Subhamathi R ...

A median (antimedian) of a profile of vertices on a graph G is a vertex that minimizes (maximizes) the remoteness value, that is, the sum of the distances ...