| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4649371 | Discrete Mathematics | 2009 | 9 Pages |
Abstract
We study the minimum number of weights assigned to the edges of a graph GG with no component K2K2 so that any two adjacent vertices have distinct sets of weights on their incident edges. The best possible upper bound on this parameter is proved.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Ervin Győri, Cory Palmer,