PreprintarXiv licencearXiv
On singular values and trace norm of signed digraphs
Abstract
Let S = (D, Ο) be a signed digraph, where D=(π±,π) is the underlying digraph of S and Ο:πβ{β1,+1} is a sign function. In this paper, we study the adjacency singular values of signed digraphs. We provide a necessary and sufficient condition for the singular values of a digraph to remain invariant under signing. We study rank of signed digraphs and determine signed digraphs with rank one. As an application of this result, we obtain a lower bound for the trace norm of signed digraphs and characterize the extremal signed digraphs.
Related
- Primitive norm extraction and a signed descent for the cubic Fermat equation
- An upper bound on the smallest singular value of dense signed random combinatorial matrices
- On trace-zero norm forms of orders of rational quaternion algebras with applications
- Projections in reduced group C*-algebras with prescribed trace values in (0,1)
- Pettis integrability of functions with values in separable symmetrically-normed ideals and related norm estimates
BibTeX
@misc{bhat2026singular,
title = {{On singular values and trace norm of signed digraphs}},
author = {Mushtaq A. Bhat and Peer Abdul Manan},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2606.15829},
eprint = {2606.15829},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2606.15829},
}
RIS
TY - UNPB
TI - On singular values and trace norm of signed digraphs
AU - Mushtaq A. Bhat
AU - Peer Abdul Manan
PY - 2026
DA - 2026/09/11
PB - arXiv
DO - 10.48550/arxiv.2606.15829
UR - https://arxiv.org/abs/2606.15829
AB - Let S = (D, Ο) be a signed digraph, where D=(π±,π) is the underlying digraph of S and Ο:πβ{β1,+1} is a sign function. In this paper, we study the adjacency singular values of signed digraphs. We provide a necessary and sufficient condition for the singular values of a digraph to remain invariant under signing. We study rank of signed digraphs and determine signed digraphs with rank one. As an application of this result, we obtain a lower bound for the trace norm of signed digraphs and characterize the extremal signed digraphs.
ER -