| MSC: | 05C78 | Graph labelling (graceful graphs, bandwidth, etc.) |
| 05C15 | Coloring of graphs and hypergraphs | |
| ZDM: | - | |
| CR: | - | |
| PACS: | - |
Abstract:
A weighting of the edges of a graph is called neighbor distinguishing if the
weighted degrees of the vertices yield a proper coloring of the graph. In this note we show that
such a weighting is possible from the weight set {1, 2, 3, 4, 5, 6} for all graphs not containing
components with exactly 2 vertices.