Hits :

First Author : Jingjing Huo

Affiliation of Author(s): 数理与信息工程学院

Date of Publication : 2017-01-01

Document Type : 期刊

Journal : Graphs and Combinatorics

Volume: Vol.33

Issue : No.2

Page Number : 419-431

ISSN : 0911-0119;1435-5914

Translation or Not : no

Key Words : Subcubic;graphs;Neighbor;sum;distinguishing;edge;coloring;Combinatorial;Nullstellensatz

Abstract : A proper edge coloring of a graph G using the color set \(\{1,2,\ldots , k\}\) is called neighbor sum distinguishing if for any pair of adjacent vertices x and y the sum of colors taken on the edges incident to x is different from the sum of colors taken