Szczegóły publikacji
Opis bibliograficzny
Equitable neighbour-sum-distinguishing edge and total colourings / Olivier Baudon, Monika PILŚNIAK, Jakub PRZYBYŁO, Mohammed Senhaji, Éric Sopena, Mariusz WOŹNIAK // Discrete Applied Mathematics ; ISSN 0166-218X. — 2017 — vol. 222, s. 40–53. — Bibliogr. s. 53, Abstr. — Publikacja dostępna online od: 2017-02-20
Autorzy (6)
- Baudon Olivier
- AGHPilśniak Monika
- AGHPrzybyło Jakub
- Senhaji Mohammed
- Sopena Éric
- AGHWoźniak Mariusz
Słowa kluczowe
Dane bibliometryczne
| ID BaDAP | 105664 |
|---|---|
| Data dodania do BaDAP | 2017-06-07 |
| Tekst źródłowy | URL |
| DOI | 10.1016/j.dam.2017.01.031 |
| Rok publikacji | 2017 |
| Typ publikacji | artykuł w czasopiśmie |
| Otwarty dostęp |  |
| Czasopismo/seria | Discrete Applied Mathematics |
Abstract
With any (not necessarily proper) edge k-colouring gamma : E(G) -> {1,..., k} of a graph G, one can associate a vertex colouring ay given by sigma(gamma)(v) = Sigma(e there exists nu) gamma(e). A neighbour-sum distinguishing edge k-colouring is an edge colouring whose associated vertex colouring is proper. The neighbour-sum-distinguishing index of a graph G is then the smallest k for which G admits a neighbour-sum-distinguishing edge k-colouring. These notions naturally extend to total colourings of graphs that assign colours to both vertices and edges. We study in this paper equitable neighbour-sum-distinguishing edge colourings and total colourings, that is colourings gamma for which the number of elements in any two colour classes of gamma 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.
