کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
5777031 | 1413649 | 2017 | 13 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Maximal m-distance sets containing the representation of the Hamming graph H(n,m)
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
A set X in the Euclidean space Rd is an m-distance set if the set of Euclidean distances between two distinct points in X has size m. An m-distance set X in Rd is maximal if there does not exist a vector x in Rd such that the union of X and {x} still has only m distances. Bannai et al. (2012) investigated maximal m-distance sets that contain the Euclidean representation of the Johnson graph J(n,m). In this paper, we consider the same problem for the Hamming graph H(n,m). The Euclidean representation of H(n,m) is an m-distance set in Rm(nâ1). We prove that if the representation of H(n,m) is not maximal as an m-distance set for some m, then the maximum value of n is m2+mâ1. Moreover we classify the largest m-distance sets that contain the representation of H(n,m) for nâ¥2 and mâ¤4. We also classify the maximal 2-distance sets that are in R2nâ1 and contain the representation of H(n,2) for nâ¥2.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Mathematics - Volume 340, Issue 3, March 2017, Pages 430-442
Journal: Discrete Mathematics - Volume 340, Issue 3, March 2017, Pages 430-442
نویسندگان
Saori Adachi, Rina Hayashi, Hiroshi Nozaki, Chika Yamamoto,