On digraphs determined by their singular values
Abstract
Let D be an digraph of order n with adjacency matrix A(D) and outdegree matrix +=+(D). Then the Laplacian and signless Laplacian matrices of D are respectively defined as L(D)=+-A(D) and Q(D)=++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, the directed cycle Cn and all orientations of a star. We show that for a bipartite digraph D, the matrices L(D) and 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, the directed cycle Cn and oriented star Sn(n-1,0) are determined by their Laplacian and signless Laplacian singular values but are not determined by their adjacency singular values.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.