Further Results on an Equitable 1-2-3 Conjecture - Archive ouverte HAL Access content directly
Journal Articles Discrete Applied Mathematics Year : 2021

Further Results on an Equitable 1-2-3 Conjecture


In this work, we consider equitable proper labellings of graphs, which were recently introduced by Baudon, Pilśniak, Przybyƚo, Senhaji, Sopena, and Wożniak. Given a graph G, the goal is to assign labels to the edges so that 1) no two adjacent vertices are incident to the same sum of labels, and 2) every two labels are assigned about the same number of times. Particularly , we aim at designing such equitable proper k-labellings of G with k being as small as possible. In connection with the so-called 1-2-3 Conjecture, it might be that labels 1,2,3 are, a few obvious exceptions apart, always sufficient to achieve this just as in the non-equitable version of the problem. We provide results regarding some open questions about equitable proper labellings. Via a hardness result, we first prove that there exist infinitely many graphs for which more labels are required in the equitable version than in the non-equitable version. This remains true in the bipartite case. We finally show that, for every $k≥3$, every k-regular bipartite graph admits an equitable proper k-labelling.
Fichier principal
Vignette du fichier
equitable_journal.pdf (666.15 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-02533537 , version 1 (06-04-2020)
hal-02533537 , version 2 (02-02-2021)
hal-02533537 , version 3 (21-02-2022)




Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney, Nicolas Nisse. Further Results on an Equitable 1-2-3 Conjecture. Discrete Applied Mathematics, 2021, 297, pp.1-20. ⟨10.1016/j.dam.2021.02.037⟩. ⟨hal-02533537v3⟩
310 View
188 Download



Gmail Mastodon Facebook X LinkedIn More