EQUAL DISTANCES BETWEEN EQUAL SETS OF VERTICES IN GRAPHS
Author:


2010 Mathematics Subject Classification:

05C12.

Keywords:

diameter, distance in graphs, homometric sets.

Abstract:

Let be three integers satisfying and . We are interested if every simple connected graph with vertices contains disjoint subsets with vertices each such that the list of distances between vertices of in the graph is the same for every , . In particular, we prove that such disjoint subsets exist if for and .

Download paper:


Vol. 8 (16), 2013
