Neighbor Sum Distinguishing Chromatic Index of Sparse Graphs via the Combinatorial Nullstellensatz

Let Ф ： E（G）→ {1, 2,…, k}be an edge coloring of a graph G. A proper edge-k-coloring of G is called neighbor sum distinguishing if ∑eЭu Ф（e）≠∑eЭu Ф（e） for each edge uv∈E（G）.The smallest value k for which G has such a coloring is denoted by χ＇Σ（G） which makes sense for graphs containing no isolated ed...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Acta Mathematicae Applicatae Sinica 2018, Vol.34 (1), p.135-144
Hauptverfasser:	Yu, Xiao-wei, Gao, Yu-ping, Ding, Lai-hao
Format:	Artikel
Sprache:	eng
Schlagworte:	Applications of Mathematics Combinatorial analysis Graph coloring Graphs Math Applications in Computer Science Mathematical and Computational Physics Mathematics Mathematics and Statistics Theoretical
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!