| Issue |
RAIRO-Oper. Res.
Volume 58, Number 2, March-April 2024
|
|
|---|---|---|
| Page(s) | 1599 - 1608 | |
| DOI | https://doi.org/10.1051/ro/2024048 | |
| Published online | 12 April 2024 | |
On spectral properties of digraphs about maximum distance
1
School of Mathematics, South China Normal University, Guangzhou 510631, P.R. China
2
Synchrony Bank, Chicago, IL 60606, USA
* Corresponding author: zhoubo@scnu.edu.cn
Received:
25
August
2023
Accepted:
16
February
2024
The maximum distance matrix of a strongly connected digraph is a symmetric matrix whose rows and columns are indexed the vertices, the entries of which correspond to the maximum directed distance between the vertices. In this paper, we determine the digraphs that uniquely minimize the largest eigenvalue of the maximum distance matrix in some classes of strongly connected digraphs, and the n-vertex strongly connected digraphs for which the maximum distance matrices have an eigenvalue with multiplicity n − 1.
Mathematics Subject Classification: 05C20 / 15A18
Key words: Max-distance matrix / max-distance spectral radius / strongly connected digraph / tournament
© The authors. Published by EDP Sciences, ROADEF, SMAI 2024
This is an Open Access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.