The neighbour sum distinguishing edge-weighting with local constraints

03/22/2022
by   Antoine Dailly, et al.
0

A k-edge-weighting of G is a mapping ω:E(G)⟶{1,…,k}. The edge-weighting naturally induces a vertex colouring σ_ω:V(G)⟶ℕ given by σ_ω(v)=∑_u∈ N_G(v)ω(vu) for every v∈ V(G). The edge-weighting ω is neighbour sum distinguishing if it yields a proper vertex colouring σ_ω, i.e., σ_ω(u)≠σ_ω(v) for every edge uv of G.We investigate a neighbour sum distinguishing edge-weighting with local constraints, namely, we assume that the set of edges incident to a vertex of large degree is not monochromatic. The graph is nice if it has no components isomorphic to K_2. We prove that every nice graph with maximum degree at most 5 admits a neighbour sum distinguishing (Δ(G)+2)-edge-weighting such that all the vertices of degree at least 2 are incident with at least two edges of different weights. Furthermore, we prove that every nice graph admits a neighbour sum distinguishing 7-edge-weighting such that all the vertices of degree at least 6 are incident with at least two edges of different weights. Finally, we show that nice bipartite graphs admit a neighbour sum distinguishing 6-edge-weighting such that all the vertices of degree at least 2 are incident with at least two edges of different weights.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/27/2020

Optimal Adjacent Vertex-Distinguishing Edge-Colorings of Circulant Graphs

A k-proper edge-coloring of a graph G is called adjacent vertex-distingu...
research
04/17/2018

Progress on the adjacent vertex distinguishing edge colouring conjecture

A proper edge colouring of a graph is adjacent vertex distinguishing if ...
research
10/28/2019

Distinguishing numbers and distinguishing indices of oriented graphs

A distinguishing r-vertex-labelling (resp. r-edge-labelling) of an undir...
research
05/05/2023

Sum-of-Local-Effects Data Structures for Separable Graphs

It is not difficult to think of applications that can be modelled as gra...
research
04/15/2018

Edge-sum distinguishing labeling

In this paper we study edge-sum distinguishing labeling, a type of label...
research
06/23/2022

Reducing the Error Floor of the Sign-Preserving Min-Sum LDPC Decoder via Message Weighting of Low-Degree Variable Nodes

Some low-complexity LDPC decoders suffer from error floors. We apply ite...
research
10/27/2021

Interaction Maxima in Distributed Systems

In this paper we study the maximum degree of interaction which may emerg...

Please sign up or login with your details

Forgot password? Click here to reset