Characterization of 2-Path Signed Network

Algorithm 3

Algorithm to check sign-regularity of 2-path signed network.

	Input: Adjacency matrix of , number of vertices and array from Algorithm 1.
	Output: Whether the 2-path of a given network is sign-reglar or not.
	Process:
(1)	Enter the adjacency matrix with elements for a given signed network along with the order of signed network .
(2)	;
(3)	fordo
(4)	;
(5)	;
(6)	;
(7)	fordo
(8)	fordo
(9)	if () then
(10)	;
(11)	for to n do
(12)	fordo
(13)	if () then
(14)	;
(15)	fordo
(16)	fordo
(17)	ifthen
(18)	Print The 2-path network is not regular.
(19)	h = 0; break;
(20)	fordo
(21)	fordo
(22)	ifdo
(23)	.
(24)	fordo
(25)	fordo
(26)	ifthen
(27)	Print “The two path network is not regular.”
(28)	h = 0;
(29)	break;
(30)	if () then
(31)	Print “The network is sign-regular.”