On Degree-Based Topological Indices for Strong Double Graphs

Algorithm 1

Computing the first Zagreb index , second Zagreb index , first Zagreb coindex , and second Zagreb coindex .

	Input:is an adjacency matrix of a finite simple connected graph
	Output:,,,
	Variables used:  = number of rows in,  = number of columns in,
(1)	, , ,
(2)	forto
(3)	forto
(4)	sum ofth row of,
(5)	sum ofth column of.
(6)	if
(7)
(8)
(9)	end if
(10)	ifand
(11)
(12)
(13)	end if
(14)	end for j
(15)	end for i