Radio Number Associated with Zero Divisor Graph

: Radio antennas use different frequency bands of Electromagnetic (EM) Spectrum for switching signals in the forms of radio waves. Regulatory authorities issue a unique number (unique identifying call sign) to each radio center, that must be used in all transmissions. Each radio center propagates channels to the two nearer radio centers so they must use distinctive numbers to avoid interruption. The task of effectively apportioning channels to transmitters is known as the Channel Assignment (CA) problem. CA Problem is discussed under the topic of graph coloring by mathematicians. The radio number of a graph can be used in many parts of the field communication. In this paper, we determined the radio number of zero-divisor graphs Γ ( Z p 2 × Z q 2 ) for p , q prime numbers.


Introduction
The antennas propagate electromagnetic waves which have different frequencies. These waves are known as Radio waves. A specific signal can be accessed by tuning the radio receiver to a particular frequency. Every radio station must be assigned distinct channels, located within a certain proximity of one another. The two radio stations are closer to each other, and then their assigned channels must have a greater difference. The task of efficiently allocating channels to transmitters is called the Channel Assignment (CA) problem.
Radio stations in the past have been used as a great source of communication but gradually the target audience is lowering. Network radio as an alternative can give news customized for a small population about local issues. But in 39 African nations, some charitable associations are using country radio stations because of specialized apparatuses for the provincial poor. In countries where access to the web is restricted and the education rate is very low, radio broadcasts are still useful. Even in advanced countries when web access is blocked, and telephone lines are cut due to some disasters people can, in any case, scan the wireless transmissions as dependable sources.
Numbers stations are shortwave radio broadcasts that are accepted to be routed to insight officials working in outside countries. Most recognized stations use discourse amalgamation to vocalize digital modes like phase-shift keying (PSK) and frequency-shift keying (FSK). Stations can have set frequencies in the HF band but some numbers stations are found by area, the innovation used to communicate the numbers has verifiably been clear-stock shortwave transmitters utilizing powers from 10 KW to 100 KW.

Motivation and Application
Graph labeling is useful in networks because each network node has a different transmission capacity for sending or receiving messages in wired or wireless links. For this purpose, the node is labeled with a unique number. This number is attained automatically by subtracting the label of link and conversely, whereas the path label specifies the pair of interconnecting terminals. For the transmitting device, a positive integer is assigned to each channel to avoid interference. This interference is so high for short-distance communication like wireless networks so the difference in channel assignment should be greater.
By using radio labeling network protocols can efficiently determine the time on which sensors communicate, this phenomenon becomes a commodity for safe transmission in Wi-Fi and cellular networks. It is unpleasant being on the phone and facing interference that is caused by unconstrained simultaneous transmissions. Two closer or physically overlapped channels can interfere or resonate to damage communications and the solution to this problem is a suitable channel assignment.

Literature Review
In 1980, William Hale [1] presented a model of the CA problem. Generally, the CA problem has been displayed as a diagram coloring and labeling problem, where the transmitters are spoken to as the vertices of a diagram. If the transmitters are altogether near one another, at that point, two vertices are adjoining. The channels allotted to the transmitters are the labels to the vertices. For each pair of labels, there is a base satisfaction separation between two different vertices with assigned labels. The last point is to find optimal labeling with the span (range) of the channels utilized is minimal.
A graph G = (V, E) consists of V, a nonempty set of vertices and E, a set of edges. Each edge has either one or two vertices associated with it, called its endpoints. An edge is said to connect its endpoints [2]. The example of radio transmitters can be well mapped on a graph by considering the transmitters as vertices and channels as edges. Each transmitter is allocated a unique channel (a positive whole number) to avoid interference. The minimum distance between stations can increase interference. Thus the distinction in channel tasks must be more noteworthy. Every transmitter deals with one transmitter or pair of neighboring transmitters. The maximum distance between any two vertices in a simple and connected graph G is known as diameter of G, it is denoted as diam(G). A function φ : V(G) → N is called a radio labeling [3,4], if the following radio condition holds for any two distinct vertices x and y: (1) d(x, y) denotes the distance between two distinct vertices x, y of a connected graph G. We denote by S(G, φ) the set of consecutive integers {a, a + 1, ..., A}, where a = min The minimum span of a radio labeling for G is called radio number of G, denoted by rn(G). A radio labeling φ of G with span(φ) = rn(G) will be called optimal radio labeling for G.
Other than its motivation by the channel problem, radio labeling itself is an appealing labeling problem and has been considered by various researchers. It is computationally extremely difficult to decide the radio number on an arbitrary diagram. The problem is known to be NP-hard for diagrams with a maximum distance of 2, yet the complexity, as a rule, is not known [5]. Thusly, the researchers start their investigation on a particular family of diagrams, for some fundamental classes of diagrams the problem showing to be difficult [4].
The radio numbers for paths and cycles were investigated in References [6][7][8], and were completely determined in Reference [4]. For all n ≤ 20 with n ≡ 0 or 2 or 4 (mod 6) the radio number is studied for cube of C n in Reference [9]. They also demonstrated the estimations of n for which this diagram is radio graceful. Ahmad and Marinescu-Ghemeci [10] investigated the radio numbers for some ladder-related diagrams. Marinescue-Ghemeci [11] determined the radio numbers for thorn stars and Saha et al. [12] investigated the radio numbers of toroidal grid. For additional detail, see References [13][14][15][16][17].
The idea of associating graphs with some algebraic objects was given by Beck [18], where he introduced a graph structure, called zero-divisor graph Γ(R) of a commutative ring R with unity. For Γ(R), he let all the ring elements be vertices and two vertices x and y are adjacent if and only if x.y = 0. After that, in 1999, Anderson and Livingston introduced a new method of associating a zero divisor graph to a commutative ring R [19], where the vertices are all non-zero zero-divisors of R and the condition for two vertices to be adjacent is the same as in Reference [18]. Ahmad and Haider [20] determined the radio number for Z p 2 × Z q . Throughout the paper we use Z * p 2 = Z p 2 \ {0}. For additional study of zero-divisor graphs, see References [21][22][23]. In the next section, we discuss the zero-divisor graph Γ(Z p 2 × Z q 2 ) and its radio number.

Zero-Divisor Graph
Let p, q be two prime numbers and Z p 2 × Z q 2 be a commutative ring with unity. Consider a zero-divisor graph Γ(Z p 2 × Z q 2 ), where the set of vertices consists of all non zero zero-divisors of Z p 2 × Z q 2 . For x ∈ Z * p 2 and y ∈ Z * q 2 , (x, y) ∈ Z p 2 × Z q 2 is a zero-divisor if and only if one of the following conditions holds: 1. at least one of x and y are zero-divisors 2. either x = 0 or y = 0.

Main Results
In the next theorem, we investigate the lower bound of radio number for zero-divisor graphs Γ(Z p 2 × Z q 2 ) for p, q prime numbers with p ≥ 5 and q = 2. Theorem 1. Let p, q be two prime numbers with p ≥ 5 and q = 2, then rn(Γ(Z p 2 × Z q 2 )) ≥ 4p 2 − 2.
For any radio labeling φ of a Γ(Z p 2 × Z q 2 ) must satisfy the following the radio condition for any distinct vertices x, y ∈ V(Γ(Z p 2 × Z q 2 )). Let φ be an optimal radio labeling for Γ(Z p 2 × Z q 2 ). We count the number of values needed for labeling and add the minimum number of forbidden values for φ. It is possible to use consecutive labels between the vertices of sets that are at distance three. There are no forbidden values associated with vertices which are distance three apart. This implies that there is no forbidden values between the sets A and D, C and D, and G and C because these are at distance three. Since the vertices of sets G and D are at distance 2 from the vertices set B. Therefore there are 2(p − 1) forbidden values between them. Similarly, the forbidden values between vertices of sets E and D are 2(p − 1). Since, |D| − |A| − |C| − |E| − |B| number of vertices will be left, the distance between the vertices of set D and G is 2, therefore the 2(p 2 − 5p + 1) forbidden values for the remaining vertices of set D and vertices of set G. Now, the distance between the vertices of set G is also 2, therefore 4p − 2 forbidden values for the remaining vertices of set G. Since the set F is at distance 1 from the vertices of sets G and D and the set F contains only one vertex for q = 2. Therefore, there are 3 forbidden values between the vertices of set G and the vertex of set F. Thus the total number of minimum forbidden values are: 2(p − 1) + 2(p − 1) + 4p − 2 + 2(p 2 − 5p + 1) + 3 = 2p 2 − 2p − 1. Adding the forbidden values to the number of vertices, we get the radio number of the given graph. Hence rn(Γ(Z p 2 × Z q 2 )) ≥ 2p 2 − 2p − 1 + 2p 2 + 2p − 1 = 4p 2 − 2, for p ≥ 5 and q = 2. Theorem 2. Let p, q be two prime numbers with p ≥ 5 and q = 2, then rn(Γ(Z p 2 × Z q 2 )) ≤ 4p 2 − 2.
Proof. We shall provide a radio labeling of Γ(Z p 2 × Z q 2 ) with span 4p 2 − 2, which implies rn(Γ(Z p 2 × Z q 2 )) ≤ 4p 2 − 2. From Theorem 1 and our convenience we define the following: The radio labeling φ : V(Γ(Z p 2 × Z q 2 )) → Z + is defined the following: It is easy to see that the span of φ is equal to 4p 2 − 2.

Claim:
The labeling φ is a valid radio labeling. We must show that the radio condition holds for all pairs of vertices x, y ∈ V(Γ(Z p 2 × Z q 2 ), where x = y. 1: Since the labels on the vertices of set A are even integers and the distance between the vertices of set A are also 2. Therefore, the radio condition (3) is satisfied for the vertices of set A.
7: Since the distance between the set A with D, C, E, F, B and G is 3, 2, 2, 2, 1 and 1, respectively and 8: Since the distance between the set B with D, G, C, E and F is 2, 2, 1, 1 and 1, respectively and 9: Since the distance between the set C with D, E, F and G is 3, 2, 2 and 3, respectively and 10: Since the distance between the set D with E, F and G is 2, 1 and 2, respectively and 11: Since the distance between the set E with F and G is 1 and 2, respectively and |φ(e i ) − φ( f j )| ≥ 3, |φ(e i ) − φ(g j )| ≥ 2.
The labeling of the vertices Γ(Z p 2 × Z q 2 ), for p = 5 and q = 2 is shown in Table 1. Table 1. The vertex labels of Γ(Z p 2 × Z q 2 ), for p = 5 and q = 2. In Figure 1 the edge connectivity between sets show the complete bipartition of sets and circle around the sets representations the complete subgraphs. Lemma 1. rn(Γ(Z p 2 × Z q 2 )) ≤ 4p 2 − 2 = 34, for p = 3 and q = 2.

Sets The Labels of Vertices
Proof. For p = 3 and q = 2, |D| = |G| and |D| = |A| + |C|, Therefore the labeling of the vertices Γ(Z p 2 × Z q 2 ), for p = 3 and q = 2 is shown in Table 2 and Figure 2. Table 2. The vertex labels of Γ(Z p 2 × Z q 2 ), for p = 3 and q = 2. It is easy to see that the radio condition is satisfied.

Sets The Labels of Vertices
By combining Lemma 1, Theorems 1 and 2, we get the following theorem.
Proof. Since, |V(Γ(Z p 2 × Z q 2 ))| = p 2 q + pq 2 − pq − 1 and |A| = q 2 − q, |B| = p − 1 |C| = (p − 1)(q 2 − q), |D| = (p 2 − p)(q − 1), |E| = (p − 1)(q − 1), |F| = q − 1 and |G| = p 2 − p. For any radio labeling φ of a Γ(Z p 2 × Z q 2 ) must satisfy the following the radio condition for any distinct vertices x, y ∈ V(Γ(Z p 2 × Z q 2 )). Let φ be an optimal radio labeling for Γ(Z p 2 × Z q 2 ). We count the number of values needed for labeling and add the minimum number of forbidden values for φ. It is possible to use consecutive labels between the vertices of sets that are at distance three. There are no forbidden values associated with vertices which are distance three apart. Since the distance between the vertices of sets A and D, C and D, and C and G is 3 and among the vertices of sets is 2. Therefore, it is possible to use consecutive labels between the vertices of sets A and D, C and D, and C and G. This means that there are no forbidden values associative with the vertices of sets A and C. As, |D| > |A| + |C| and |D| − |A| − |C| = p 2 q − p 2 − pq 2 + p number of elements will be left in set D.
The vertices of sets B and E are at distance 2 from the vertices of of the set G, i.e., d(G, B) = d(G, E) = 2 and d(B, B) = d(E, E) = 1. Therefore, there are 2(p − 1) and 2(p − 1)(q − 1) forbidden values between the vertices of B and E, respectively. As, |G| > |B| + |E| and |G| − |B| − |E| = p 2 − pq − p + q number of elements will be left in set G. Hence, there are p 2 q − pq 2 − pq + q total number of elements are left in sets D and G. Now, d(F, F) = d(D, F) = d(G, F) = 1 and |F| = q − 1. This implies that there are 3(q − 1) forbidden values between set F with set D or G. Hence, the remaining p 2 q − pq 2 − pq + q − (q − 1) = p 2 q − pq 2 − pq + 1 vertices will be left. Since, d(D, D) = d(G, D) = d(D, G) = 2, therefore the remaining vertices will be the forbidden values between them i.e., p 2 q − pq 2 − pq + 1 forbidden values.
Finally, the total number of minimum forbidden values will be the sum of all forbidden values which is equal to 2(p − 1) By adding the forbidden values and the number of vertices to label provide a total of 2p 2 q + q − 3 labels, hence rn(Γ(Z p 2 × Z q 2 )) ≥ 2p 2 q + q − 3, for p > q ≥ 3. Theorem 5. Let p, q be two prime numbers with p > q ≥ 3. Then rn(Γ(Z p 2 × Z q 2 )) ≤ 2p 2 q + q − 3.

Conclusions
This article underlines the calculation of radio number for zero divisor graphs comprised of commutative rings Z p 2 × Z q 2 . The theoretical results obtained in this article have potential to be useful in communication networks, circuit design, and sensor networks. In a particular context, they are useful in radio engineering where frequency bands allowed individuals to transmit voice, text, image, and data communications in local and global span even into space.