An improved bound for equitable proper labellings
In this paper, the authors prove that for every graph \(G\) with size \(m\) and no connected component isomorphic to \(K_2\), for \(L = (1, 1, 2, 2,\ldots ,\lfloor m/2\rfloor + 2, \lfloor m/2\rfloor + 2)\), we can assign labels of \(L\) to the edges of \(G\) in an injective way so that no two adjacent vertices of \(G\) are incident to the same sum of labels. This implies that every such graph with size \(m\) can be labelled in an equitable and proper way with labels from \(\{1,\ldots ,\lfloor m/2\rfloor + 2 \}\), which improves on a result proved by \textit{J. Haslegrave} [Discrete Math. Theor. Comput. Sci. 20, No. 1, Paper No. 18, 14 p. (2018; Zbl 1401.05260)], and \textit{K. S. Lyngsie} and \textit{L. Zhong} [Graphs Comb. 34, No. 6, 1363--1369 (2018; Zbl 1402.05186)], implying this can be achieved with labels from \(\{1,\ldots ,m\}\). Different questions and problems of independent interest for further work on the topic conclude the paper.
- A generalized version of a local antimagic labelling conjecture
- A solution to the 1-2-3 conjecture
- Edge weights and vertex colours
- Equitable neighbour-sum-distinguishing edge and total colourings
- Further results on an equitable 1-2-3 conjecture
- scientific article; zbMATH DE number 47933 (Why is no real title available?)
- On a combination of the 1-2-3 conjecture and the antimagic labelling conjecture
- Proof of a local antimagic conjecture
This page was built for publication: An improved bound for equitable proper labellings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6857923)
