Integer sets with prescribed pairwise differences being distinct (Q1775027): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 05:39, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Integer sets with prescribed pairwise differences being distinct |
scientific article |
Statements
Integer sets with prescribed pairwise differences being distinct (English)
0 references
4 May 2005
0 references
For a graph \(G,\) denote by \(D(G)\) the smallest number \(k\) so that there is an injection \(f:V(G)\rightarrow \{1,2,\dots,k\}\) with the property that \( \left| f(u)-f(v)\right| \) are pairwise distinct for any edge \(uv\) of \(G.\) In the paper sharp bounds on the maximum value of \(D(G)\) that a graph \(G \) with given number of vertices and edges can have are given.
0 references
difference-magic labeling
0 references
