An Improved Upper Bound on Neighbor Expanded Sum Distinguishing Index
A total k-weighting f of a graph G is an assignment of integers from the set {1, . . . , k} to the vertices and edges of G. We say that f is neighbor expanded sum distinguishing, or NESD for short, if Σw∈N(v) (f(vw) + f(w)) differs from Σw∈N(u)(f(uw) + f(w)) for every two adjacent vertices v and u o...
| Published in: | Discussiones Mathematicae Graph Theory |
|---|---|
| Main Author: | |
| Format: | Article |
| Language: | English |
| Published: |
University of Zielona Góra
2020-02-01
|
| Subjects: | |
| Online Access: | https://doi.org/10.7151/dmgt.2130 |