Sum choice number of generalized θ-graphs

In this paper we obtain sharp upper bounds for the sum choice number of all generalized θ-graphs with k1≥2 and characterize all generalized θ-graphs G which attain the trivial upper bound |V(G)|+|E(G)|.