✦ LIBER ✦

On a generalization of distance sets

✍ Scribed by Hiroshi Nozaki; Masashi Shinohara

Book ID: 108167298
Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 262 KB
Volume: 117
Category: Article
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2009.11.001

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On Distance-Sets

✍ Besicovitch, A. S. 📂 Article 📅 1948 🏛 Oxford University Press 🌐 English ⚖ 163 KB

A generalization of comparative probabil

A generalization of comparative probability on finite sets

✍ P.C Fishburn 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 724 KB

On One Generalization of Chernov's Dista

On One Generalization of Chernov's Distance

✍ Salikhov, N. P. 📂 Article 📅 1999 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 356 KB

A generalization of Kraemer's result on

A generalization of Kraemer's result on difference sets

✍ James A Davis 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 316 KB

On distance sets of large sets of intege

On distance sets of large sets of integer points

✍ Ákos Magyar 📂 Article 📅 2008 🏛 The Hebrew University Magnes Press 🌐 English ⚖ 174 KB

On distinct distance sets in a graph

✍ Xiaohui Lin; Minghua Zhu; Zhengguo Yu; Chengxue Zhang; Yuansheng Yang 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 182 KB

A distinct distance set (DD set) for a graph G is a vertex subset of G with the property that for ISI = s, we have (~) distinct distances of the pairs of vertices in S. In this article, it is shown that (a) For 6 ~< k ~< 18 there exists a tree T with DD(T) = k and din(T) = LB(k) < B~(Kk). where LB(