In this chapter, for an ideal I of N we introduce the notions of equiprime graph of N denoted by EQ I (N) and c-prime graph of N denoted by C I (N). We relate EQ I (N), C I (N) and the graph G I (N). We prove that diam(EQ I (N \ I)) ≤ 3 and diam(C I (N \ I)) ≤ 3 and show that the prime graphs are edge partitionable. It is well-known that the homomorphic image of a prime ideal need not be a prime ideal in general. We study graph homomorphisms and obtain conditions under which the primeness property of an ideal is preserved under nearring homomorphisms.