Title of article
Sequence of maximal distance codes in graphs or other metric spaces
Author/Authors
Delorme, C. University Paris Sud, France
From page
118
To page
124
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
maximal distance code , graph , metric space
Journal title
Electronic Journal of Graph Theory and Applications (EJGTA)
Journal title
Electronic Journal of Graph Theory and Applications (EJGTA)
Record number
2553642
Link To Document