Neighbour-distinguishing labellings of families of graphs (Q2141099)

A labelling of a graph \(G\) is a mapping \(\pi: S\to \mathcal{L}\) where \(\mathcal{L}\subset \mathbb{R}\) and \(S=E(G)\) or \(S=V(G)\cup E(G)\). When \(S=E(G)\), then \(\pi\) is an \(\mathcal{L}\)-edge-labelling, and when \(S=V(G)\cup E(G)\), then \(\pi\) is an \(\mathcal{L}\)-total-labelling. For each \(v\in V(G)\), the colour of \(v\) is defined as \(c_{\pi}(v)=\sum_{uv\in E(G)}\pi(uv)\) when \(\pi\) is an \(\mathcal{L}\)-edge-labelling, and \(c_{\pi}(v)=\pi(v)+\sum_{uv\in E(G)}\pi(uv)\) when \(\pi\) is an \(\mathcal{L}\)-total-labelling. The pair \((\pi, c_{\pi})\) is a neighbour-distinguishing \(\mathcal{L}\)-edge-labelling (neighbour-distinguishing \(\mathcal{L}\)-total-labelling) if \(\pi\) is an \(\mathcal{L}\)-edge-labelling (\(\mathcal{L}\)-total-labelling) and \(c_{\pi}(u)\neq c_{\pi}(v)\) for any pair of adjacent vertices \(u,v\). It is shown that split graphs, regular cobipartite graphs, complete multipartite graphs and cubic graphs have neighbour-distinguishing \(\{a,b,c\}\)-edge-labellings for distinct \(a,b,c\in\mathbb{R}\) and in some cases even for \(a,b,c\geq0\). For split graphs and regular cobipartite graphs it is also proved that they admit neighbor-distinguishing \(\{a,b\}\)-total-labellings. It is further shown that flower snarks and some subfamilies of split graphs and regular cobipartite graphs have neighbour-distinguishing \(\{a,b\}\)-edge-labellings and on the other hand some families of split graphs do not have neighbour-distinguishing \(\mathcal{L}\)-edge-labellings for \(\mathcal{L}=\{a,2a\}\) and \(\mathcal{L}=\{0,a\}\), where \(a,b\in\mathbb{R}\setminus\{0\}, a\neq b\). This result for \(\mathcal{L}=\{1,2,3\}\) partially answers the 1-2-3 conjecture, and for \(\mathcal{L}=\{1,2\}\) the 1-2 conjecture for the respective graph classes.