Disjoint homometric sets in graphs

Two subsets of vertices in a graph are called homometric if the multisets of distances determined by them are the same. Let h(n) denote the largest number h such that any connected graph of n vertices contains two disjoint homometric subsets of size h. It is shown that (c log n)/(log log n) < h(n) < n/4, for n > 3.


Published in:
Ars Maththematica Contemporeana, 4, 1, 1-4
Year:
2011
Laboratories:




 Record created 2011-12-12, last modified 2018-03-17


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)