{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T07:34:36Z","timestamp":1768721676937,"version":"3.49.0"},"reference-count":24,"publisher":"EDP Sciences","issue":"6","license":[{"start":{"date-parts":[[2023,11,30]],"date-time":"2023-11-30T00:00:00Z","timestamp":1701302400000},"content-version":"vor","delay-in-days":29,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100003453","name":"Natural Science Foundation of Guangdong Province","doi-asserted-by":"publisher","award":["2021A1515010028"],"award-info":[{"award-number":["2021A1515010028"]}],"id":[{"id":"10.13039\/501100003453","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"accepted":{"date-parts":[[2023,10,22]]},"published-print":{"date-parts":[[2023,11]]},"abstract":"<jats:p>The eccentricity matrix of a graph is defined as the matrix obtained from its distance matrix by retaining the largest elements in each row and column, while the rest elements are set to be zero. The eccentricity eigenvalues of a graph are the eigenvalues of its eccentricity matrix, the eccentricity energy of a graph is the sum of the absolute values of its eccentricity eigenvalues, and the eccentricity spectral radius of a graph is its largest eccentricity eigenvalue. Let <jats:italic>g<jats:sub>n,d<\/jats:sub><\/jats:italic> be the set of <jats:italic>n<\/jats:italic>-vertex connected graphs with odd diameter <jats:italic>d<\/jats:italic>, where each graph <jats:italic>G<\/jats:italic> in <jats:italic>g<jats:sub>n,d<\/jats:sub><\/jats:italic> has a diametrical path whose center edge is a cut edge of <jats:italic>G<\/jats:italic>. For any graph <jats:italic>G<\/jats:italic> in <jats:italic>g<jats:sub>n,d<\/jats:sub><\/jats:italic>, we construct a weighted graph <jats:italic>H<\/jats:italic><jats:sup><jats:italic>\u03c9<\/jats:italic><\/jats:sup> such that its adjacency matrix is just the eccentricity matrix of <jats:italic>G<\/jats:italic>, where <jats:italic>H<\/jats:italic> is the sequential join graph of the complement graphs of four disjoint complete graphs. In terms of the energy and spectral radius of the weighted graphs, we determine the graphs with minimum eccentricity energy, minimum and maximum eccentricity spectral radius in <jats:italic>g<jats:sub>n,d<\/jats:sub><\/jats:italic>, respectively. As corollaries, we determine the trees with minimum eccentricity energy, minimum and maximum eccentricity spectral radius among all trees with odd diameter, respectively.<\/jats:p>","DOI":"10.1051\/ro\/2023168","type":"journal-article","created":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T19:03:23Z","timestamp":1698087803000},"page":"3141-3156","source":"Crossref","is-referenced-by-count":7,"title":["On the eccentricity energy and eccentricity spectral radius of graphs with odd diameter"],"prefix":"10.1051","volume":"57","author":[{"given":"Leshi","family":"Qiu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianping","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4709-7351","authenticated-orcid":false,"given":"Jianbin","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2023,11,30]]},"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":"Brouwer A.E. and Haemers W.H., Spectra of Graphs. Springer, New York (2012).","DOI":"10.1007\/978-1-4614-1939-6"},{"key":"R3","unstructured":"Cvetkoi\u0107 D., Doob M. and Sachs H., Spectra of Graphs-Theory and Applications. Academic Press, New York (1980)."},{"key":"R4","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF00552542","volume":"45","author":"Gutman","year":"1977","journal-title":"Theor. Chim. Acta (Berlin)"},{"key":"R5","doi-asserted-by":"crossref","unstructured":"Gutman I., Li X. and Zhang J., Graph energy, edited by Dehmer M., Emmert-Streib F., In Analysis of Complex Networks: From Biology to Linguistics. Wiley-VCH Verlag, Weinheim (2009) 145\u2013174.","DOI":"10.1002\/9783527627981.ch7"},{"key":"R6","doi-asserted-by":"crossref","first-page":"112662","DOI":"10.1016\/j.disc.2021.112662","volume":"345","author":"He","year":"2022","journal-title":"Discrete Math."},{"key":"R7","unstructured":"Horn R.A. and Johnson C.R., Matrix Analysis, 2nd edition. Cambridge University Press, Cambridge (2013)."},{"key":"R8","doi-asserted-by":"crossref","first-page":"113067","DOI":"10.1016\/j.disc.2022.113067","volume":"345","author":"Mahato","year":"2022","journal-title":"Discrete Math."},{"key":"R9","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1515\/spma-2021-0156","volume":"10","author":"Mahato","year":"2022","journal-title":"Spec. Matrices"},{"key":"R10","unstructured":"Mahato I. and Kannan M.R., Minimizers for the energy of eccentricity matrices of trees. Preprint arXiv:2208.13462 (2022)."},{"key":"R11","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1016\/j.dam.2020.05.029","volume":"285","author":"Mahato","year":"2020","journal-title":"Discrete Appl. Math."},{"key":"R12","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1080\/03081087.2021.2015274","volume":"71","author":"Mahato","year":"2023","journal-title":"Linear Multilinear Algebra"},{"key":"R13","first-page":"126995","volume":"422","author":"Lei","year":"2022","journal-title":"Appl. Math. Comput."},{"key":"R14","doi-asserted-by":"crossref","first-page":"4363","DOI":"10.3934\/math.2023217","volume":"8","author":"Li","year":"2023","journal-title":"AIMS Math."},{"key":"R15","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/j.dam.2023.03.029","volume":"336","author":"Li","year":"2023","journal-title":"Discrete Appl. Math."},{"key":"R16","doi-asserted-by":"crossref","first-page":"112591","DOI":"10.1016\/j.disc.2021.112591","volume":"344","author":"Patel","year":"2021","journal-title":"Discrete Math."},{"key":"R17","first-page":"221","volume":"70","author":"Randi\u0107","year":"2013","journal-title":"MATCH Commun. Math. Comput. Chem."},{"key":"R18","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/j.dam.2018.05.062","volume":"251","author":"Wang","year":"2018","journal-title":"Discrete Appl. Math."},{"key":"R19","doi-asserted-by":"crossref","first-page":"2636","DOI":"10.1016\/j.disc.2019.05.033","volume":"342","author":"Wang","year":"2019","journal-title":"Discrete Math."},{"key":"R20","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1016\/j.dam.2019.10.015","volume":"279","author":"Wang","year":"2020","journal-title":"Discrete Appl. Math."},{"key":"R21","doi-asserted-by":"crossref","first-page":"104173","DOI":"10.1016\/j.chemolab.2020.104173","volume":"207","author":"Wang","year":"2020","journal-title":"Chemom. Intell. Lab. Syst."},{"key":"R22","first-page":"127036","volume":"424","author":"Wei","year":"2022","journal-title":"Appl. Math. Comput."},{"key":"R23","doi-asserted-by":"crossref","first-page":"111925","DOI":"10.1016\/j.disc.2020.111925","volume":"343","author":"Wei","year":"2020","journal-title":"Discrete Math."},{"key":"R24","doi-asserted-by":"crossref","first-page":"112686","DOI":"10.1016\/j.disc.2021.112686","volume":"345","author":"Wei","year":"2022","journal-title":"Discrete Math."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2023168\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,30]],"date-time":"2023-11-30T09:18:23Z","timestamp":1701335903000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2023168"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11]]},"references-count":24,"journal-issue":{"issue":"6"},"alternative-id":["ro220724"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2023168","relation":{},"ISSN":["0399-0559","2804-7303"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"2804-7303","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,11]]}}}