On the Minimum Coprime Number of Some Graphs
Let G be a finite simple graph. A coprime labeling of G is an injective assignment of positive integers to the vertices such that adjacent vertices receive relatively prime labels. The minimum coprime number of G, denoted by pr(G), is the smallest integer k for which G admits a coprime labeling using labels from {1, 2,...