Sequence of maximal distance codes in graphs or other metric spaces

Charles Delorme

Abstract


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.

Keywords


codes ; distances

Full Text:

PDF

DOI: http://dx.doi.org/10.5614/ejgta.2013.1.2.5

Refbacks

  • There are currently no refbacks.


ISSN: 2338-2287

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

View EJGTA Stats