Abstract
The 1–2–3 Conjecture, raised by Karoński, Łuczak and Thomason, states that almost every graph G admits a proper 3-labelling, i.e., a labelling of the edges with 1, 2, 3 such that no two adjacent vertices are incident to the same sum of labels. Another interpretation of this conjecture, that may be attributed to Chartrand et al., is that almost every graph G can be turned into a locally irregular multigraph M, i.e., with no two adjacent vertices having the same degree, by replacing each of its edges by at most three parallel edges. In other words, for almost every graph G there should be a locally irregular multigraph M with the same adjacencies and having a relatively small number of edges. The 1–2–3 Conjecture, if true, would indeed imply that there is such an M with \(|E(M)| \le 3|E(G)|\). In this work, we study proper labellings of graphs with the extra requirement that the sum of assigned labels must be as small as possible. In other words, given a graph G, we are looking for a locally irregular multigraph \(M^*\) with the smallest number of edges possible that can be obtained from G by multiplying edges. This problem is actually quite different from the 1–2–3 Conjecture, as we prove that there is no absolute constant k such that \(M^*\) can always be obtained from G by replacing each edge with at most k parallel edges. We investigate several aspects of this problem, covering algorithmic and combinatorial aspects. In particular, we prove that the problem of designing proper labellings with minimum label sum is \({\mathcal {N}}{\mathcal {P}}\)-hard in general, but solvable in polynomial time for graphs with bounded treewidth. We also conjecture that for almost every connected graph G there should be a proper labelling with label sum at most 2|E(G)|, which we verify for several classes of graphs.
Similar content being viewed by others
Notes
An extended abstract of this paper has been accepted in the proceedings of the 31st International Workshop on Combinatorial Algorithms (IWOCA 2020) [4].
References
Baudon, O., Bensmail, J., Hocquard, H., Senhaji, M., Sopena, E.: Edge weights and vertex colours: minimizing sum count. Discrete Appl. Math. 270, 13–24 (2019)
Baudon, O., Bensmail, J., Przybyło, J., Woźniak, M.: On decomposing regular graphs into locally irregular subgraphs. Eur. J. Comb. 49, 90–104 (2015)
Baudon, O., Pilśniak, M., Przybyło, J., Senhaji, M., Sopena, E., Woźniak, M.: Equitable neighbour-sum-distinguishing edge and total colourings. Discrete Appl. Math. 222, 40–53 (2017)
Bensmail, J., Fioravantes, F., Nisse, N.: On proper labellings of graphs with minimum label sum. In: L. Gasieniec, R. Klasing, T. Radzik (eds.) Combinatorial Algorithms - 31st International Workshop, IWOCA 2020, Bordeaux, France, June 8–10, 2020, Proceedings, Lecture Notes in Computer Science, vol. 12126, pp. 56–68. Springer, Berlin (2020)
Bensmail, J., Li, B., Li, B., Nisse, N.: On minimizing the maximum color for the 1–2–3 conjecture. Discrete Appl. Math. 289, 32–51 (2021)
Bensmail, J., Mc Inerney, F., Lyngsie Szabo, K.: On \(\{a,b\}\)-edge-weightings of bipartite graphs with odd \(a,b\). Discussiones Mathematicae Graph Theory p (to appear) (2019)
Bodlaender, H.L.: A partial \(k\)-arboretum of graphs with bounded treewidth. Theor. Comput. Sci. 209(1), 1–45 (1998)
Chang, G., Lu, C., Wu, J., Yu, Q.: Vertex-coloring edge-weightings of graphs. Taiwan. J. Math. 15, 1807–1813 (2011)
Chartrand, G., Erdös, P., Oellermann, O.: How to define an irregular graph. Coll. Math. J. 19, 36–42 (1998)
Chartrand, G., Jacobon, M., Lehel, J., Oellermann, O., Ruiz, S., Saba, F.: Irregular networks. Congr. Numer. 64, 197–210 (1986)
Diestel, R.: Graph Theory, 4th Edition, Graduate Texts in Mathematics, vol. 173. Springer, Berlin (2012)
Dudek, A., Wajc, D.: On the complexity of vertex-coloring edge-weightings. Discrete Math. Theor. Comput. Sci. 13, 45–50 (2011)
Kalkowski, M., Karoński, M., Pfender, F.: Vertex-coloring edge-weightings: towards the 1–2–3-conjecture. J. Comb. Theory Ser. B 100(3), 347–349 (2010)
Karoński, M., Łuczak, T., Thomason, A.: Edge weights and vertex colours. J. Comb. Theory Ser. B 91(1), 151–157 (2004)
Lu, H., Yu, Q., Zhang, C.Q.: Vertex-coloring 2-edge-weighting of graphs. Eur. J. Comb. 32(1), 21–27 (2011)
Lyngsie, K.S.: On neighbour sum-distinguishing \(\{0,1\}\)-edge-weightings of bipartite graphs. Discret. Math. Theor. Comput. Sci. 20(1) (2018)
Mulzer, W., Rote, G.: Minimum-weight triangulation is NP-hard. J. ACM 55, 1–29 (2006)
Przybyło, J.: The 1–2–3 conjecture almost holds for regular graphs. J. Comb. Theory, Ser. B 147, 183–200 (2021)
Seamone, B.: The 1–2–3 conjecture and related problems: a survey. CoRR (2012) http://arxiv.org/abs/1211.5122
Thomassen, C., Wu, Y., Zhang, C.Q.: The 3-flow conjecture, factors modulo \(k\), and the 1–2–3-conjecture. J. Comb. Theory Ser. B 121, 308–325 (2016)
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Bensmail, J., Fioravantes, F. & Nisse, N. On Proper Labellings of Graphs with Minimum Label Sum. Algorithmica 84, 1030–1063 (2022). https://doi.org/10.1007/s00453-021-00903-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-021-00903-x