The vertices of any simple graph can be labeled in infinitely many ways with positive integers so that two vertices are joined by an edge if, and only if, they have a common divisor greater than 1.

Are there graphs for which there are infinitely many numbers that cannot be the sum of the labels in such a labeling of its vertices? Infinitely many? It has been shown, for example, that every sufficiently large number can be the sum of the labels in such a labeling of the Petersen graph (Finding the largest number which cannot be the sum of the labels of the Petersen graph).