Abstract
The distance spectral radius λ(G) of a strongly connected digraph G is the eigenvalue of its distance matrix D(G) with the largest modulus. Let Gnd denote the set of strongly connected digraphs with order n and diameter d. In this paper, we completely determine the strongly connected digraphs minimizing λ(G) among all strongly connected digraphs with order n and diameter d, for d = 1, 2, 3, 4, 5, 6, 7, n−1. We also propose a conjecture about the minimum distance spectral radius among all strongly connected digraphs with given diameter d≥8.
Funding Information
  • National Natural Science Foundation of China (1871398)
  • Natural Science Basic Research Plan in Shaanxi Province of China (Program No. 2018JM1032)
  • China Scholarship Council (201706290182)

This publication has 16 references indexed in Scilit: