A Novel Mathematical Model for Radio Mean Square Labeling Problem

Algorithm 1

Finding an upper bound of the radio mean square number of a graph .

 Input: be an -vertex graph, simple connected graph, and the diameter of

 Output: an upper bound of radio mean square number of

 Begin

 Step 1: choose a vertex and

 Step 2:

 Step 3: for all , compute

 Step 4: let

 Step 5: choose a vertex , such that

 Step 6: give

 Step 7:

 Step 8: repeat Step 3–Step 6 until all vertices are labelled

 Step 9: repeat Step 1–Step 7 for every vertex

 End