id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
ejpam-4798	Kumar, Sandeep ; Sinha, Deepa	Spectral Analysis of Splitting Signed Graph	2024	15	.pdf	application/pdf	5715	291	76	= a(i, j) 3: Check 4: if N mod 2 = 1 then 5: Print: matrix is of odd order, splitting root signed graph dose not exist 6: Terminate 7: else 8: for i = 1 : N do 9: for j = 1 : N do 10: check 11: if a(i,j)==1 then 12: countp = countp + 1 13: else 14: if a(i,j)== -1 then 15: countq = countq + 1 16: end if 17: end if 18: end for 19: end for 20: end if 21: check 22: if countp mod 3 == 0 && countq mod 3 == 0 then 23: Print: Splitting root signed graph is possible 24: else 25: Print: Splitting root signed graph is not possible and Terminate 26: end if 27: Assign: positive[i] = countp 28: negative[i] = countq 29: boole[i] = F 30: for i = 1 : N do 31: for j = i+ 1 : N do 32: Assign: k A signed graph Σ is called a splitting signed graph if it is isomorphic to the splitting signed graph Γ(U) of some signed graph U , where U is referred to as the splitting root signed graph of Σ. 1 2 3 4 5 1 2 1 ' 2' 3' 4' 5' 35 4 Figure 1: Signed graph Σ and its splitting signed graph Γ(Σ)	cache/ejpam-4798.pdf	txt/ejpam-4798.txt