English

On digraphs determined by their singular values

Combinatorics 2026-04-07 v1

Abstract

Let DD be an digraph of order nn with adjacency matrix A(D)A(D) and outdegree matrix Δ+=Δ+(D)\Delta^+=\Delta^+(D). Then the Laplacian and signless Laplacian matrices of DD are respectively defined as L(D)=Δ+A(D)L(D)=\Delta^+-A(D) and Q(D)=Δ++A(D)Q(D)=\Delta^++A(D). In this paper, we compute singular values and an exact formula for the trace norm of Laplacian matrices of the directed path Pn\overrightarrow{P_n}, the directed cycle Cn\overrightarrow{C_n} and all orientations of a star. We show that for a bipartite digraph DD, the matrices L(D)L(D) and Q(D)Q(D) have same singular values and use this to compute the singular values and trace norm of signless Laplacian matrices. We study the problem of determination of digraphs by their singular values and prove the directed path Pn\overrightarrow{P_n}, the directed cycle Cn\overrightarrow{C_n} and oriented star Sn(n1,0)\overrightarrow{S}_n(n-1,0) are determined by their Laplacian and signless Laplacian singular values but are not determined by their adjacency singular values.

Keywords

Cite

@article{arxiv.2604.03615,
  title  = {On digraphs determined by their singular values},
  author = {Mushtaq A. Bhat and Peer Abdul Manan},
  journal= {arXiv preprint arXiv:2604.03615},
  year   = {2026}
}
R2 v1 2026-07-01T11:53:43.018Z