An injective version of the 1-2-3 Conjecture - Archive ouverte HAL Access content directly
Journal Articles Graphs and Combinatorics Year : 2021

An injective version of the 1-2-3 Conjecture


In this work, we introduce and study a new graph labelling problem standing as a combination of the 1-2-3 Conjecture and injective colouring of graphs, which also finds connections with the notion of graph irregularity. In this problem, the goal, given a graph G, is to label the edges of G so that every two vertices having a common neighbour get incident to different sums of labels. We are interested in the minimum k such that G admits such a k-labelling. We suspect that almost all graphs G can be labelled this way using labels 1,...,∆(G). Towards this speculation, we provide bounds on the maximum label value needed in general. In particular, we prove that using labels 1,...,∆(G) is indeed sufficient when G is a tree, a particular cactus, or when its injective chromatic number χi(G) is equal to ∆(G).
Fichier principal
Vignette du fichier
injective123c.pdf (566.31 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02459377 , version 1 (29-01-2020)



Julien Bensmail, Bi Li, Binlong Li. An injective version of the 1-2-3 Conjecture. Graphs and Combinatorics, 2021, 37, pp.281-311. ⟨10.1007/s00373-020-02252-y⟩. ⟨hal-02459377⟩
93 View
97 Download



Gmail Facebook Twitter LinkedIn More