Every nice graph (no K2 components) with Δ≤5 admits a neighbour-sum-distinguishing (Δ+2)-edge-weighting where deg≥2 vertices have at least two distinct incident weights; every nice graph admits such a 7-weighting for deg≥6 vertices; nice bipartite graphs admit a 6-weighting for deg≥2 vertices.
Przyby/suppress lo,A note on asymptotically optimal neighbour sum distinguish ing colourings, European Journal of Combinatorics 77 (2019) 49–56
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DM 1years
2022 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Neighbour sum distinguishing edge-weightings with local constraints
Every nice graph (no K2 components) with Δ≤5 admits a neighbour-sum-distinguishing (Δ+2)-edge-weighting where deg≥2 vertices have at least two distinct incident weights; every nice graph admits such a 7-weighting for deg≥6 vertices; nice bipartite graphs admit a 6-weighting for deg≥2 vertices.