Loading...
research article
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.
Type
research article
Authors
Publication date
2011
Published in
Volume
4
Issue
1
Start page
1
End page
4
Peer reviewed
REVIEWED
EPFL units
Available on Infoscience
December 12, 2011
Use this identifier to reference this record