On Characterization of Balance and Consistency Preserving d-Antipodal Signed Graphs
A signed graph is an ordered pair Σ=(G, σ), where G is a graph and σ: E (G)⟶{+ 1,− 1} is a
mapping. For e∈ E (G), σ (e) is called the sign of e and for any sub-graph H of G, σ (H)=∏ …
mapping. For e∈ E (G), σ (e) is called the sign of e and for any sub-graph H of G, σ (H)=∏ …