Group sum chromatic number of graphs

Marcin Anholcer , Sylwia Cichacz

Abstract

We investigate the group sum chromatic number (χ Σ g (G)) of graphs, i.e. the smallest value s such that taking any Abelian group G of order s, there exists a function f : E(G) → G such that the sums of edge labels properly colour the vertices. It is known that χ Σ g (G) ∈ {χ (G), χ (G) + 1} for any graph G with no component of order less than 3 and we characterize the graphs for which χ Σ g (G) = χ (G).
Author Marcin Anholcer (WIiGE / KBO)
Marcin Anholcer,,
- Department of Operations Research
, Sylwia Cichacz - AGH University of Science and Technology (AGH), MNiSW [80]
Sylwia Cichacz,,
-
Journal seriesEuropean Journal of Combinatorics, ISSN 0195-6698, (A 30 pkt)
Issue year2016
Vol55
Pages73-81
Publication size in sheets0.5
Keywords in Englishsum chromatic number, 1,2,3-Conjecture, graph weighting, graph labelling, Abelian group
ASJC Classification2607 Discrete Mathematics and Combinatorics
DOIDOI:10.1016/j.ejc.2016.02.002
URL http://www.sciencedirect.com/science/article/pii/S0195669816000147
Languageen angielski
Score (nominal)30
Score sourcejournalList
ScoreMinisterial score = 25.0, 10-01-2020, ArticleFromJournal
Ministerial score (2013-2016) = 30.0, 10-01-2020, ArticleFromJournal
Publication indicators WoS Citations = 3; Scopus SNIP (Source Normalised Impact per Paper): 2016 = 1.167; WoS Impact Factor: 2016 = 0.786 (2) - 2016=0.828 (5)
Citation count*8 (2020-06-25)
Cite
Share Share

Get link to the record


* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.
Back
Confirmation
Are you sure?