Sequence of maximal distance codes in graphs or other metric spaces

Given a subset C in a metric space E , its successor is the subset  s ( C ) of points at maximum distance from C in E . We study some properties of the sequence obtained by iterating this operation.  Graphs with their usual distance provide already typical examples.

[1]  James R. Munkres,et al.  Topology; a first course , 1974 .

[2]  It Informatics.  On-Line Encyclopedia of Integer Sequences , 2010 .

[3]  Miguel Angel Fiol,et al.  The Manhattan product of digraphs , 2013, Electron. J. Graph Theory Appl..

[4]  Yvette Amice,et al.  Les nombres p-adiques , 1975 .

[5]  Stefan Friedrich,et al.  Topology , 2019, Arch. Formal Proofs.