{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:28:04Z","timestamp":1740144484194,"version":"3.37.3"},"reference-count":16,"publisher":"EDP Sciences","issue":"2","license":[{"start":{"date-parts":[[2024,4,12]],"date-time":"2024-04-12T00:00:00Z","timestamp":1712880000000},"content-version":"vor","delay-in-days":42,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12071158"],"award-info":[{"award-number":["12071158"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"accepted":{"date-parts":[[2024,2,16]]},"published-print":{"date-parts":[[2024,3]]},"abstract":"<jats:p>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 <jats:italic>n<\/jats:italic>-vertex strongly connected digraphs for which the maximum distance matrices have an eigenvalue with multiplicity <jats:italic>n<\/jats:italic> <jats:italic>\u2212<\/jats:italic> 1.<\/jats:p>","DOI":"10.1051\/ro\/2024048","type":"journal-article","created":{"date-parts":[[2024,2,20]],"date-time":"2024-02-20T19:53:25Z","timestamp":1708458805000},"page":"1599-1608","source":"Crossref","is-referenced-by-count":0,"title":["On spectral properties of digraphs about maximum distance"],"prefix":"10.1051","volume":"58","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4268-0652","authenticated-orcid":false,"given":"Leyou","family":"Xu","sequence":"first","affiliation":[]},{"given":"Shilin","family":"Wang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7321-9554","authenticated-orcid":false,"given":"Bo","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"250","published-online":{"date-parts":[[2024,4,12]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/j.laa.2014.06.010","volume":"458","author":"Aouchiche","year":"2014","journal-title":"Linear Algebra Appl."},{"key":"R2","doi-asserted-by":"crossref","unstructured":"Bang-Jensen J. and Gutin G.Z., Digraphs: Theory, Algorithms and Applications. Springer, London (2009).","DOI":"10.1007\/978-1-84800-998-1"},{"key":"R3","unstructured":"Buckley F. and Harary F., Distance in Graphs. Addison-Wesley Publishing Company, Redwood City, CA (1990)."},{"key":"R4","unstructured":"Chartrand G. and Tian S., Maximum distance in digraphs, in Graph Theory, Combinatorics, Algorithms, and Applications, edited by Alavi Y., Chung F.R.K., Graham R.L. and Hsu D.F.. SIAM, Philadelphia, PA (1991) 525\u2013538."},{"key":"R5","doi-asserted-by":"crossref","first-page":"716","DOI":"10.21136\/CMJ.1991.102502","volume":"41","author":"Chartrand","year":"1991","journal-title":"Czechoslovak Math. J."},{"key":"R6","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/S0898-1221(97)00216-2","volume":"34","author":"Chartrand","year":"1997","journal-title":"Comput. Math. Appl."},{"key":"R7","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1002\/jgt.22057","volume":"85","author":"Guo","year":"2017","journal-title":"J. Graph Theory"},{"key":"R8","unstructured":"Horn R.A. and Johnson C.R., Matrix Analysis, 2nd edition. Cambridge University Press, Cambridge (2013)."},{"key":"R9","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1016\/j.laa.2014.10.028","volume":"466","author":"Liu","year":"2015","journal-title":"Linear Algebra Appl."},{"key":"R10","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1080\/0025570X.1980.11976831","volume":"53","author":"Maurer","year":"1980","journal-title":"Math. Mag."},{"key":"R11","unstructured":"Minc H., Nonnegative Matrices. John Wiley & Sons, New York (1988)."},{"key":"R12","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/j.laa.2019.09.024","volume":"584","author":"Mohar","year":"2020","journal-title":"Linear Algebra Appl."},{"key":"R13","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0095-8956(82)90046-6","volume":"33","author":"Neumann-Lara","year":"1982","journal-title":"J. Combin. Theory Ser. B"},{"key":"R14","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/j.laa.2019.04.038","volume":"577","author":"Xi","year":"2019","journal-title":"Linear Algebra Appl."},{"key":"R15","unstructured":"Xu J., Combinatorial Theory in Networks. Science Press, Beijing (2013)."},{"key":"R16","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/j.dam.2022.05.011","volume":"320","author":"Xu","year":"2022","journal-title":"Discrete Appl. Math."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2024048\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,12]],"date-time":"2024-04-12T08:26:29Z","timestamp":1712910389000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2024048"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3]]},"references-count":16,"journal-issue":{"issue":"2"},"alternative-id":["ro230590"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2024048","relation":{},"ISSN":["0399-0559","2804-7303"],"issn-type":[{"type":"print","value":"0399-0559"},{"type":"electronic","value":"2804-7303"}],"subject":[],"published":{"date-parts":[[2024,3]]}}}