Szczegóły publikacji
Opis bibliograficzny
On the neighbour sum distinguishing index of graphs with bounded maximum average degree / H. Hocquard, J. PRZYBYŁO // Graphs and Combinatorics ; ISSN 0911-0119. — 2017 — vol. 33 iss. 6, s. 1459–1471. — Bibliogr. s. 1470–1471, Abstr. — Publikacja dostępna online od: 2017-06-13
Autorzy (2)
- Hocquard Hervé
- AGHPrzybyło Jakub
Słowa kluczowe
Dane bibliometryczne
| ID BaDAP | 110793 |
|---|---|
| Data dodania do BaDAP | 2017-12-22 |
| Tekst źródłowy | URL |
| DOI | 10.1007/s00373-017-1822-3 |
| Rok publikacji | 2017 |
| Typ publikacji | artykuł w czasopiśmie |
| Otwarty dostęp |  |
| Czasopismo/seria | Graphs and Combinatorics |
Abstract
A proper edge k-colouring of a graph G = (V, E) is an assignment c : E -> {1, 2, ... , k} of colours to the edges of the graph such that no two adjacent edges are associated with the same colour. A neighbour sum distinguishing edge k-colouring, or nsd k-colouring for short, is a proper edge k-colouring such that Sigma(e(sic)u) c(e) not equal Sigma(e(sic)v) c(e) for every edge uv of G. We denote by. chi'(Sigma)(G) the neighbour sum distinguishing index of G, which is the least integer k such that an nsd k-colouring of G exists. By definition at least maximum degree, Delta(G) colours are needed for this goal. In this paper we prove that. chi'(Sigma)(G) <= Delta (G)+ 1 for any graph G without isolated edges, with mad(G) < 3 and Delta (G) >= 6.
