Name
Abstract | ||
|---|---|---|
The problem of labelling the complete graph K n as near to graceful as possible is equivalent to the ‘Golomb ruler problem’ of finding as short a ruler as possible with n integer marks such that the distances between pairs of marks are all distinct. We generalize this to an association between labellings of K n with m -tuples and ‘distinct distance sets’ in m -dimensional grids. More generally, we define distinct distance sets for any graph G and investigate the parameter DD( G ) which is the maximum size of a distinct distance set in G . |
Year | DOI | Venue |
|---|---|---|
1991 | 10.1016/0012-365X(91)90251-V | Discrete Mathematics |
Keywords | Field | DocType |
distinct distance set | Integer,Discrete mathematics,Graph,Complete graph,Combinatorics,Golomb ruler,Graph isomorphism,Tuple,Ruler,Mathematics | Journal |
Volume | Issue | ISSN |
93 | 2-3 | Discrete Mathematics |
Citations | PageRank | References |
2 | 0.89 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Richard A. Gibbs | 1 | 56 | 10.04 |
| Peter J. Slater | 2 | 593 | 132.02 |