Characterization of 2-Path Product Signed Graphs with Its Properties

Algorithm 3

Algorithm to obtain a 2-path product signed graph for a given signed graph.

Input. Adjacency matrix and dimension .

Output. Adjacency matrix of 2-path signed graph

Process

(1)  Enter the order and adjacency matrix of for a given signed graph .

(2)  Collect all the pairs for given signed graph .

(3)  for to do

(4)    for to do

(5)      if then

(6)        ;

(7)  for to do

(8)   for to do

(9)   for to do

(10)     if then

(11)        if then

(12)          

(13)          

(14)       else

(15)          

(16)