4 citations · 12 across the 7 of their papers we have counts for
1 paper · 1 filter
Marina Arav, Hein van der Holst, John Sinkovic
A signed graph is a pair (G,Σ), where G=(V,E) is a graph (in which parallel edges and loops are permitted) with V={1,…,n} and Σ⊆E. The edges in Σ are call…