| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 8903426 | Electronic Notes in Discrete Mathematics | 2017 | 10 Pages |
Abstract
In this note we give general lower and upper bounds for the sum choice number. We determine all connected graphs G whose sum choice number attains the lower bound 2|V|â1 or 2|V|. Moreover, we determine all complete multipartite graphs whose sum choice number attains the upper bound |V|+|E|.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Arnfried Kemnitz, Massimiliano Marangio, Margit Voigt,