Behzad and Chartrand [1]} defined line sigraph
\(L(\Sigma )\)  as the sigraph in which the edges of \(\Sigma \)  are represented as vertices, two of these
vertices are defined adjacent whenever the corresponding edges in \(\Sigma \)  have a vertex in
common, any such edge ef is defined to be negative whenever both \(e\)  and \(f\)  are
negative edges in \(\Sigma \) . A positive cycle in \(\Sigma \)  is a cycle which contains even number of negative edges.
A sigraph \(\Sigma \)  is a balanced sigraph if every cycle in \(\Sigma \)  is positive.
The first classification of balanced graphs was done by Harary in 1953 [2]}.
