On the distance spectral radius of digraphs with given diameter

Weige Xi, Wasin So, Ligong Wang

Research output: Contribution to journalArticlepeer-review

4 Scopus citations

Abstract

The distance spectral radius (Formula presented.) of a strongly connected digraph G is the eigenvalue of its distance matrix (Formula presented.) with the largest modulus. Let (Formula presented.) denote the set of strongly connected digraphs with order n and diameter d. In this paper, we completely determine the strongly connected digraphs minimizing (Formula presented.) 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 (Formula presented.).

Original languageEnglish
Pages (from-to)2547-2557
Number of pages11
JournalLinear and Multilinear Algebra
Volume69
Issue number14
DOIs
StatePublished - 2021

Keywords

  • diameter
  • distance spectral radius
  • Strongly connected

Fingerprint

Dive into the research topics of 'On the distance spectral radius of digraphs with given diameter'. Together they form a unique fingerprint.

Cite this