Asymptotically optimal neighbour sum distinguishing colourings of graphs

@article{Przybylo2015AsymptoticallyON,
  title={Asymptotically optimal neighbour sum distinguishing colourings of graphs},
  author={Jakub Przybylo},
  journal={Random Struct. Algorithms},
  year={2015},
  volume={47},
  pages={776-791}
}
Consider a simple graph G = (V, E) and its proper edge colouring c with the elements of the set {1, 2, . . . , k}. The colouring c is said to be neighbour sum distinguishing if for every pair of vertices u, v adjacent in G, the sum of colours of the edges incident with u is distinct from the corresponding sum for v. The smallest integer k for which such colouring exists is known as the neighbour sum distinguishing index of a graph and denoted by χ∑(G). The definition of this parameter, which… CONTINUE READING
6 Extracted Citations
0 Extracted References
Similar Papers

Similar Papers

Loading similar papers…