Upper Bounds of Radio Number for Triangular Snake and Double Triangular Snake Graphs

Algorithm 1

[2] Finding a radio k-coloring of a graph.

	Input: be an n-vertex simple connected graph, k be a positive integer, and the adjacency matrix A[n][n] of
	Output: A radio k-coloring of .
	Begin
	Compute the distance matrix D[n][n] of using Floyed–Warshall’s algorithm and the adjacency matrix A[n][n] of .
	RadioNumber = ;
	for l = 1 to n do
	for i = 1 to n do
	labeling [i] = 0;
	end
	for i = 1 to n do
	for j = 1 to n do
	c[i][j] = diam + 1 − D[i][j];
	end
	c[i][j] = ;
	end
	for i = 2 to n do
	/find the minimum value m of the column with position p/
	[m, p] = min [c(l, :)];
	for j = 1 to n
	c[p][j] = c[p][j] + m
	if c[p][j] < c[l][j]
	c[p][j] = c[l][j]
	end
	end
	labeling [p] = m
	l = p
	end
	/find the max value of the labeling/
	Max_Value = max (labeling))
	if RadioNumber > Max_Value
	RadioNumber = Max_Value
	end
	end
	End