Let RR be a weakly factorial domain which admits at least two maximal ideals. We use 𝒫(R) to denote the set of all primary elements of R and denote 𝒫(R)∖{0} by 𝒫(R)∗. Let 𝒬(R)={Rq|q∈𝒫(R)∗}. We denote the subset of 𝒬(R) consisting of all Rq∈𝒬(R) such that q does not belong to the Jacobson radical of R by 𝒮𝒬(R). With R, in this paper, we associate an undirected graph denoted by ℂ𝔾ℙ(R) whose vertex set is 𝒮𝒬(R) and distinct vertices Rq1 and Rq2 are adjacent if and only if Rq1+Rq2=R. In Secs. 2 and 3 of this paper, we discuss results regarding the connectedness, the girth, and the clique number of ℂ𝔾ℙ(R) and study the interplay between graph properties of ℂ𝔾ℙ(R) and the properties of R. In Secs. 4 and 5 of this paper, we consider a supergraph of ℂ𝔾ℙ(R), denoted by 𝕊𝔾ℂ𝔾ℙ(R) whose vertex set is 𝒮𝒬(R) and distinct vertices Rq1 and Rq2 are adjacent if and only if Rq1∩Rq2=Rq1q2 and study some graph properties of 𝕊𝔾ℂ𝔾ℙ(R).