Szczegóły publikacji
Opis bibliograficzny
Group twin edge coloring of graphs / Sylwia CICHACZ, Jakub PRZYBYŁO // Discrete Mathematics and Theoretical Computer Science ; ISSN 1462-7264. — 2018 — vol. 20 no. 1 art. no. 24, s. 1–14. — Bibliogr. s. 12–14
Autorzy (2)
Słowa kluczowe
Dane bibliometryczne
| ID BaDAP | 114939 |
|---|---|
| Data dodania do BaDAP | 2018-07-12 |
| Tekst źródłowy | URL |
| DOI | 10.23638/DMTCS-20-1-24 |
| Rok publikacji | 2018 |
| Typ publikacji | artykuł w czasopiśmie |
| Otwarty dostęp |  |
| Creative Commons | |
| Czasopismo/seria | Discrete Mathematics and Theoretical Computer Science |
Abstract
For a given graph G, the least integer k≥2 such that for every Abelian group G of order k nthere exists a proper edge labeling f:E(G)→G so that ∑x∈N(u)f(xu)≠∑x∈N(v)f(xv) for each edge uv∈E(G) is called the group twin chromatic index of G and denoted by χ′g(G). This graph invariant is related to a few well-known problems in the field of neighbor distinguishing graph colorings. We conjecture that χ′g(G)≤Δ(G)+3 for all graphs without isolated edges, where Δ(G) is the maximum degree of G, and provide an infinite family of connected graph (trees) for which the equality holds. We prove that this conjecture is valid for all trees, and then apply this result as the base case for proving a general upper bound for all graphs G without isolated edges: χ′g(G)≤2(Δ(G)+col(G))−5, where col(G) denotes the coloring number of G. This improves the best known upper bound known previously only for the case of cyclic groups Zk.
