On extremal spectral results of digraphs based on sum distance (Q2166213)

The paper studies the sum distance of a strong digraph by studying the spectral properties of the sum distance matrix and related sum distance signless Laplacian and sum distance Laplacian. For simple graphs, their associated symmetric matrices have well-defined spectral properties. For digraphs, one way to do this is to use the sum of distances from \(u\) to \(v\) and from \(v\) to \(u\) between two vertices in a strong digraph as a way to associate symmetric matrices with a strong digraph called sum distance matrices and to study their spectral properties instead of those defined using the maximum of distances because the maximum of distances seems do not distinguish the digraphs as the sum distances in many cases. The paper gives those digraphs that uniquely minimize and/or maximize the largest eigenvalue in some families of strong digraphs and also determines the digraphs minimizing and/or maximizing other eigenvalues, particularly, the second largest and/or the smallest ones. In addition, it determines those digraphs that uniquely minimize and/or maximize the general sum distance spectral radius as well as the sum distance Laplacian spectral radius in some families of strong digraphs, and also determines the digraphs that minimize and/or maximize other sum distance, sum distance signless Laplacian and sum distance Laplacian eigenvalues, especially, the second largest and/or the smallest ones.