Frequency Assignment Model of Zero Divisor Graph

Algorithm 2

Input: zero divisor graph of a finite commutative ring of order where are distinct prime.

Step 1: calculate the cardinality of the nontrivial divisor sets.

Step 2: compare the cardinalities of , and and find the greatest set.

Step 3: if and OR and

Assign labeling scheme as .

Else

Assign labeling scheme as .

Output: determine the suitable labeling scheme of .