A projective-planar signed graph has no two vertex-disjoint negative circles. We prove that every signed graph with no two vertex-disjoint negative circles and no balancing vertex...
Intuitively, a signed graph is a graph in which every edge is labeled with a + or − sign. For each edge, its sign represents the mode of the relationship between the vertices it...
Abstract. Previous studies on social networks are often focused on networks with only positive relations between individual nodes. As a significant extension, we conduct the spectr...
We characterize the edge-signed graphs in which every 'significant' positive closed walk (or combination of walks) has even length, under seven different criteria for si...
Trust networks, where people leave trust and distrust feedback, are becoming increasingly common. These networks may be regarded as signed graphs, where a positive edge weight cap...
Cho-Jui Hsieh, Kai-Yang Chiang, Inderjit S. Dhillo...