On singular values and trace norm of signed digraphs

Abstract

Let $S = (D, σ)$ be a signed digraph, where $D=(\mathcal{V},\mathcal{A})$ is the underlying digraph of $S$ and $σ:\mathcal{A}\rightarrow\{-1,+1\}$ is a sign function. In this paper, we study the singular values of adjacency matrix of $S$ and show that unlike eigenvalues, the singular values of unicyclic and bicyclic digraphs remain invariant under signing, thereby providing two families of switching non-isomorphic signed digraphs having same singular values. We also provide examples where singular values of digraphs change with signing. We study rank of signed digraphs and determine signed digraphs with rank one by using interlacing property of singular values. As an application of this result, we obtain a lower bound for the trace norm of signed digraphs and characterize the extremal signed digraphs.