| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4654787 | European Journal of Combinatorics | 2008 | 11 Pages |
Abstract
Let DD be a set of positive integers. The distance graph generated by DD, denoted by G(Z,D)G(Z,D), has the set ZZ of all integers as the vertex set, and two vertices xx and yy are adjacent whenever |x−y|∈D|x−y|∈D. For integers 1
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Daphne Der-Fen Liu, Xuding Zhu,