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 ?$\frac{c \log n}{\log\log n} < h(n) < \frac{n}{4}$?, for ?$n > 3$?.

Rights

URN

URN:NBN:SI:DOC-G44RD9FV

COBISSID

16089945

Added

16.12.2021

Metadata

Citation

APA:

Albertson, Michael O., Pach, János, Young, Michael E. (2011). Disjoint homometric sets in graphs. Ars mathematica contemporanea, volume 4, issue 1, str. 1-4. URN:NBN:SI:DOC-G44RD9FV from http://www.dlib.si

MLA:

Albertson, Michael O., Pach, János, Young, Michael E.. "Disjoint homometric sets in graphs." Ars mathematica contemporanea volume 4. issue 1 (2011) str. 1-4.
<http://www.dlib.si/?URN=URN:NBN:SI:DOC-G44RD9FV>

Ars mathematica contemporanea
2008-
(Assembly record)