This paper studies learning meaningful node representations for signed graphs, where both positive and negative links exist. problem has been widely studied by meticulously designing expressive graph neural networks, as well capturing the structural information of through traditional structure decomposition methods, e.g., spectral theory. In this paper, we propose a novel representation framewo...

A signed graph has edge weights drawn from the set $\{+1,-1\}$, and is termed sign-balanced if it equivalent to an unsigned under operation of sign switching; otherwise called sign-unbalanced. nut a one dimensional kernel with corresponding eigenvector that full. In this paper we generalise notion graphs graphs. Orders for which regular exist were determined recently degrees up $11$. By extendi...