Related papers: Signed Graph Analysis for the Interpretation of Vo…
The study of social networks is a burgeoning research area. However, most existing work deals with networks that simply encode whether relationships exist or not. In contrast, relationships in signed networks can be positive ("like",…
Let $X$ be a non-empty ground set and $\mathcal{P}(X)$ be its power set. A set-labeling (or a set-valuation) of a graph $G$ is an injective set-valued function $f:V(G)\to \mathcal{P}(X)$ such that the induced function $f^\oplus:E(G) \to…
This paper addresses the behavior analysis problems for directed signed networks that involve cooperative-antagonistic interactions among agents. Of particular interest is to explore the convergence behaviors of directed signed networks…
Numerous real-world relations can be represented by signed networks with positive links (e.g., trust) and negative links (e.g., distrust). Link analysis plays a crucial role in understanding the link formation and can advance various tasks…
A signed graph is said to be sign-symmetric if it is switching isomorphic to its negation. Bipartite signed graphs are trivially sign-symmetric. We give new constructions of non-bipartite sign-symmetric signed graphs. Sign-symmetric signed…
We study asymptotic dynamical patterns that emerge among a set of nodes that interact in a dynamically evolving signed random network. Node interactions take place at random on a sequence of deterministic signed graphs. Each node receives…
Graph-theoretical labeling provides a rigorous mathematical framework for characterizing the structural and functional organization of complex networks. This paper investigates the application of cordial labeling and signed product cordial…
Bipartite networks provide a major insight into the organisation of many real-world systems. One of the most relevant issues encountered when modelling a bipartite network is that of facing the information shortage concerning intra-layer…
This paper, we explore the dynamics of threshold networks on undirected signed graphs. Much attention has been dedicated to understanding the convergence and long-term behavior of this model. Yet, an open question persists: How does the…
The frustration index is a key measure for analysing signed networks, which has been underused due to its computational complexity. We use an exact optimisation-based method to analyse frustration as a global structural property of signed…
Structural balance is a classic property of signed graphs satisfying Heider's seminal axioms. Mathematical sociologists have studied balance theory since its inception in the 1040s. Recent research has focused on the development of dynamic…
Ensuring legislative accountability in multi-party systems requires quantitative tools that reveal actual voting behavior beyond formal party affiliations. We present a network-based framework for analyzing parliamentary dynamics at…
Recent studies from social, biological, and engineering network systems have drawn attention to the dynamics over signed networks, where each link is associated with a positive/negative sign indicating trustful/mistrustful,…
Graph representation learning has become a prominent tool for the characterization and understanding of the structure of networks in general and social networks in particular. Typically, these representation learning approaches embed the…
The total graph is built by joining the graph to its line graph by means of the incidences. We introduce a similar construction for signed graphs. Under two similar definitions of the line signed graph, we define the corresponding total…
A "signed graph" is a graph $\Gamma$ where the edges are assigned sign labels, either "$+$" or "$-$". The sign of a cycle is the product of the signs of its edges. Let $\mathrm{SpecC}(\Gamma)$ denote the list of lengths of cycles in…
A signed graph is one that features two types of edges: positive and negative. Balanced signed graphs are those in which all cycles contain an even number of positive edges. In the adjacency matrix of a signed graph, entries can be $0$,…
Argument graphs provide an abstract representation of an argumentative situation. A bipolar argument graph is a directed graph where each node denotes an argument, and each arc denotes the influence of one argument on another. Here we…
A signed graph $\Gamma$ is said to be determined by its spectrum if every signed graph with the same spectrum as $\Gamma$ is switching isomorphic with $\Gamma$. Here it is proved that the path $P_n$, interpreted as a signed graph, is…
A signed bipartite graph G(U, V) is a bipartite graph in which each edge is assigned a positive or a negative sign. The signed degree of a vertex x in G(U, V) is the number of positive edges incident with x less the number of negative edges…