| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4949645 | Discrete Applied Mathematics | 2017 | 14 Pages |
Abstract
We study in this paper equitable neighbour-sum-distinguishing edge colourings and total colourings, that is colourings γ for which the number of elements in any two colour classes of γ differ by at most one. We determine the equitable neighbour-sum-distinguishing index of complete graphs, complete bipartite graphs and forests, and the equitable neighbour-sum-distinguishing total chromatic number of complete graphs and bipartite graphs.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Olivier Baudon, Monika PilÅniak, Jakub PrzybyÅo, Mohammed Senhaji, Ãric Sopena, Mariusz Woźniak,