0 KB173 KB7 KB200820252011Albertson, Michael O.Pach, JánosYoung, Michael E.številka:1letnik:4str. 1-4COBISSID:16089945ISSN:1855-3966URN:URN:NBN:SI:doc-G44RD9FVenDruštvo matematikov, fizikov in astronomov SlovenijeArs mathematica contemporaneaGolumb rulergraph distancesgraph theoryhomometric subsetshomometrične podmnožiceravninski grafirazdalje v grafihteorija grafovDisjoint 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 ?$\frac{c \log n}{\log\log n} < h(n) < \frac{n}{4}$?, for ?$n > 3$?TEXTznanstveno časopisjejournalsSlovenian National E-content AggregatorNational and University Library of SloveniaUniverza na Primorskem, Fakulteta za naravoslovje, matematiko in informacijske tehnologije