{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T18:56:40Z","timestamp":1781895400032,"version":"3.54.5"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,3,24]],"date-time":"2022-03-24T00:00:00Z","timestamp":1648080000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,3,24]],"date-time":"2022-03-24T00:00:00Z","timestamp":1648080000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100004564","name":"Ministarstvo Prosvete, Nauke i Tehnolo\u0161kog Razvoja","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004564","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2022,4]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Let <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\dot{G}=(G,\\sigma )$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mover>\n                      <mml:mi>G<\/mml:mi>\n                      <mml:mo>\u02d9<\/mml:mo>\n                    <\/mml:mover>\n                    <mml:mo>=<\/mml:mo>\n                    <mml:mrow>\n                      <mml:mo>(<\/mml:mo>\n                      <mml:mi>G<\/mml:mi>\n                      <mml:mo>,<\/mml:mo>\n                      <mml:mi>\u03c3<\/mml:mi>\n                      <mml:mo>)<\/mml:mo>\n                    <\/mml:mrow>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> be a signed graph, and let <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\rho (\\dot{G})$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>\u03c1<\/mml:mi>\n                    <mml:mo>(<\/mml:mo>\n                    <mml:mover>\n                      <mml:mi>G<\/mml:mi>\n                      <mml:mo>\u02d9<\/mml:mo>\n                    <\/mml:mover>\n                    <mml:mo>)<\/mml:mo>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> (resp.\u00a0<jats:inline-formula><jats:alternatives><jats:tex-math>$$\\lambda _1(\\dot{G})$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:msub>\n                      <mml:mi>\u03bb<\/mml:mi>\n                      <mml:mn>1<\/mml:mn>\n                    <\/mml:msub>\n                    <mml:mrow>\n                      <mml:mo>(<\/mml:mo>\n                      <mml:mover>\n                        <mml:mi>G<\/mml:mi>\n                        <mml:mo>\u02d9<\/mml:mo>\n                      <\/mml:mover>\n                      <mml:mo>)<\/mml:mo>\n                    <\/mml:mrow>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>) denote the spectral radius (resp.\u00a0the index) of the adjacency matrix <jats:inline-formula><jats:alternatives><jats:tex-math>$$A_{\\dot{G}}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msub>\n                    <mml:mi>A<\/mml:mi>\n                    <mml:mover>\n                      <mml:mi>G<\/mml:mi>\n                      <mml:mo>\u02d9<\/mml:mo>\n                    <\/mml:mover>\n                  <\/mml:msub>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>. In this paper we detect the signed graphs achieving the minimum spectral radius <jats:inline-formula><jats:alternatives><jats:tex-math>$$m(\\mathcal S \\mathcal R_n)$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>m<\/mml:mi>\n                    <mml:mo>(<\/mml:mo>\n                    <mml:mi>S<\/mml:mi>\n                    <mml:msub>\n                      <mml:mi>R<\/mml:mi>\n                      <mml:mi>n<\/mml:mi>\n                    <\/mml:msub>\n                    <mml:mo>)<\/mml:mo>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, the maximum spectral radius <jats:inline-formula><jats:alternatives><jats:tex-math>$$M(\\mathcal S \\mathcal R_n)$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>M<\/mml:mi>\n                    <mml:mo>(<\/mml:mo>\n                    <mml:mi>S<\/mml:mi>\n                    <mml:msub>\n                      <mml:mi>R<\/mml:mi>\n                      <mml:mi>n<\/mml:mi>\n                    <\/mml:msub>\n                    <mml:mo>)<\/mml:mo>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, the minimum index <jats:inline-formula><jats:alternatives><jats:tex-math>$$m(\\mathcal I_n)$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>m<\/mml:mi>\n                    <mml:mo>(<\/mml:mo>\n                    <mml:msub>\n                      <mml:mi>I<\/mml:mi>\n                      <mml:mi>n<\/mml:mi>\n                    <\/mml:msub>\n                    <mml:mo>)<\/mml:mo>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> and the maximum index <jats:inline-formula><jats:alternatives><jats:tex-math>$$M(\\mathcal I_n)$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>M<\/mml:mi>\n                    <mml:mo>(<\/mml:mo>\n                    <mml:msub>\n                      <mml:mi>I<\/mml:mi>\n                      <mml:mi>n<\/mml:mi>\n                    <\/mml:msub>\n                    <mml:mo>)<\/mml:mo>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> in the set <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\mathcal U_n$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msub>\n                    <mml:mi>U<\/mml:mi>\n                    <mml:mi>n<\/mml:mi>\n                  <\/mml:msub>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> of all unbalanced connected signed graphs with <jats:inline-formula><jats:alternatives><jats:tex-math>$$n\\geqslant 3$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>n<\/mml:mi>\n                    <mml:mo>\u2a7e<\/mml:mo>\n                    <mml:mn>3<\/mml:mn>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> vertices. From the explicit computation of the four extremal values it turns out that the difference <jats:inline-formula><jats:alternatives><jats:tex-math>$$m(\\mathcal S \\mathcal R_n)-m(\\mathcal I_n)$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>m<\/mml:mi>\n                    <mml:mrow>\n                      <mml:mo>(<\/mml:mo>\n                      <mml:mi>S<\/mml:mi>\n                      <mml:msub>\n                        <mml:mi>R<\/mml:mi>\n                        <mml:mi>n<\/mml:mi>\n                      <\/mml:msub>\n                      <mml:mo>)<\/mml:mo>\n                    <\/mml:mrow>\n                    <mml:mo>-<\/mml:mo>\n                    <mml:mi>m<\/mml:mi>\n                    <mml:mrow>\n                      <mml:mo>(<\/mml:mo>\n                      <mml:msub>\n                        <mml:mi>I<\/mml:mi>\n                        <mml:mi>n<\/mml:mi>\n                      <\/mml:msub>\n                      <mml:mo>)<\/mml:mo>\n                    <\/mml:mrow>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> for <jats:inline-formula><jats:alternatives><jats:tex-math>$$n \\geqslant 8$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>n<\/mml:mi>\n                    <mml:mo>\u2a7e<\/mml:mo>\n                    <mml:mn>8<\/mml:mn>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> strictly increases with <jats:italic>n<\/jats:italic> and tends to 1, whereas <jats:inline-formula><jats:alternatives><jats:tex-math>$$M(\\mathcal S \\mathcal R_n)- M(\\mathcal I_n)$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>M<\/mml:mi>\n                    <mml:mrow>\n                      <mml:mo>(<\/mml:mo>\n                      <mml:mi>S<\/mml:mi>\n                      <mml:msub>\n                        <mml:mi>R<\/mml:mi>\n                        <mml:mi>n<\/mml:mi>\n                      <\/mml:msub>\n                      <mml:mo>)<\/mml:mo>\n                    <\/mml:mrow>\n                    <mml:mo>-<\/mml:mo>\n                    <mml:mi>M<\/mml:mi>\n                    <mml:mrow>\n                      <mml:mo>(<\/mml:mo>\n                      <mml:msub>\n                        <mml:mi>I<\/mml:mi>\n                        <mml:mi>n<\/mml:mi>\n                      <\/mml:msub>\n                      <mml:mo>)<\/mml:mo>\n                    <\/mml:mrow>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> strictly decreases and tends to 0.<\/jats:p>","DOI":"10.1007\/s40314-022-01814-5","type":"journal-article","created":{"date-parts":[[2022,3,25]],"date-time":"2022-03-25T04:39:15Z","timestamp":1648183155000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Unbalanced signed graphs with extremal spectral radius or index"],"prefix":"10.1007","volume":"41","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2742-1919","authenticated-orcid":false,"given":"Maurizio","family":"Brunetti","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4949-4203","authenticated-orcid":false,"given":"Zoran","family":"Stani\u0107","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,3,24]]},"reference":[{"key":"1814_CR1","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/j.laa.2018.05.012","volume":"553","author":"S Akbari","year":"2018","unstructured":"Akbari S, Belardo F, Dodongeh E, Nematollahi MA (2018) Spectral characterizations of signed cycles. Linear Algebra Appl 553:307\u2013327","journal-title":"Linear Algebra Appl"},{"key":"1814_CR2","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/j.laa.2018.04.021","volume":"553","author":"S Akbari","year":"2018","unstructured":"Akbari S, Haemers WH, Maimani HR, Parsaei Majd L (2018) Signed graphs cospectral with the path. Linear Algebra Appl 553:104\u2013116","journal-title":"Linear Algebra Appl"},{"key":"1814_CR3","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/j.laa.2019.06.016","volume":"581","author":"S Akbari","year":"2019","unstructured":"Akbari S, Belardo F, Heydari F, Maghasedi M, Souri M (2019) On the largest eigenvalue of signed unicyclic graphs. Linear Algebra Appl 581:145\u2013162","journal-title":"Linear Algebra Appl"},{"key":"1814_CR4","doi-asserted-by":"publisher","first-page":"393","DOI":"10.7151\/dmgt.2276","volume":"40","author":"S Akbari","year":"2020","unstructured":"Akbari S, Davandi S, Heydari F, Maghasedi M (2020) Signed complete graphs with maximum index. Discuss Math Graph Theory 40:393\u2013403","journal-title":"Discuss Math Graph Theory"},{"key":"1814_CR5","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/j.laa.2016.02.028","volume":"497","author":"F Belardo","year":"2016","unstructured":"Belardo F, Zhou Y (2016) Signed graphs with extremal least Laplacian eigenvalue. Linear Algebra Appl 497:167\u2013180","journal-title":"Linear Algebra Appl"},{"key":"1814_CR6","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/j.laa.2018.07.026","volume":"557","author":"F Belardo","year":"2018","unstructured":"Belardo F, Brunetti M, Ciampella A (2018) Signed bicyclic graphs minimizing the least Laplacian eigenvalue. Linear Algebra Appl 557:201\u2013233","journal-title":"Linear Algebra Appl"},{"issue":"2","key":"1814_CR7","doi-asserted-by":"publisher","first-page":"417","DOI":"10.21136\/CMJ.2020.0403-19","volume":"71","author":"F Belardo","year":"2021","unstructured":"Belardo F, Brunetti M, Ciampella A (2021) Unbalanced unicyclic and bicyclic graphs with extremal spectral radius. Czechoslovak Math J 71(2):417\u2013433","journal-title":"Czechoslovak Math J"},{"key":"1814_CR8","volume-title":"Spectra of Graphs - Theory and Application","author":"D Cvetkovi\u0107","year":"1995","unstructured":"Cvetkovi\u0107 D, Doob M, Sachs H (1995) Spectra of Graphs - Theory and Application, 3rd edn. Johann Ambrosius Barth Verlag, Heidelberg-Leipzig","edition":"3"},{"issue":"8","key":"1814_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2021.112463","volume":"344","author":"E Ghorbani","year":"2021","unstructured":"Ghorbani E (2021) Majidi A (2021) Signed graphs with maximal index. Discrete Math. 344(8):112463","journal-title":"Discrete Math."},{"key":"1814_CR10","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/s40314-021-01498-3","volume":"40","author":"C He","year":"2021","unstructured":"He C, Li Y, Shan H, Wang W (2021) On the index of unbalanced signed bicyclic graphs. Comput Appl Math 40:124","journal-title":"Comput Appl Math"},{"key":"1814_CR11","doi-asserted-by":"publisher","first-page":"2187","DOI":"10.1080\/03081087.2016.1265480","volume":"65","author":"T Koledin","year":"2017","unstructured":"Koledin T, Stani\u0107 Z (2017) Connected signed graphs of fixed order, size, and number of negative edges with maximal index. Linear Multilinear Algebra 65:2187\u20132198","journal-title":"Linear Multilinear Algebra"},{"key":"1814_CR12","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1016\/j.jalgebra.2007.05.019","volume":"317","author":"J McKee","year":"2007","unstructured":"McKee J, Smyth C (2007) Integer symmetric matrices having all their eigenvalues in the interval $$[-2,\\, 2]$$. J Algebra 317:260\u2013290","journal-title":"J Algebra"},{"key":"1814_CR13","doi-asserted-by":"publisher","first-page":"2050016","DOI":"10.1142\/S1793830920500160","volume":"12","author":"F Souri","year":"2020","unstructured":"Souri F, Heydari F, Maghasedi M (2020) Maximizing the largest eigenvalues of signed unicyclic graphs. Discrete Math Algorithms Appl 12:2050016","journal-title":"Discrete Math Algorithms Appl"},{"key":"1814_CR14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781316341308","volume-title":"Inequalities for Graph Eigenvalues","author":"Z Stani\u0107","year":"2015","unstructured":"Stani\u0107 Z (2015) Inequalities for Graph Eigenvalues. Cambridge University Press, Cambridge"},{"key":"1814_CR15","doi-asserted-by":"publisher","first-page":"841","DOI":"10.7151\/dmgt.2035","volume":"38","author":"Z Stani\u0107","year":"2018","unstructured":"Stani\u0107 Z (2018) Pertubations in a signed graph and its index. Discuss Math Graph Theory 38:841\u2013852","journal-title":"Discuss Math Graph Theory"},{"key":"1814_CR16","doi-asserted-by":"crossref","unstructured":"Stani\u0107 Z (2019a) Bounding the largest eigenvalue of signed graphs. Linear Algebra Appl 573:80\u201389","DOI":"10.1016\/j.laa.2019.03.011"},{"key":"1814_CR17","doi-asserted-by":"crossref","unstructured":"Stani\u0107 Z (2019b) Integral regular net-balanced signed graphs with vertex degree at most four. Ars Math Contemp 17:103\u2013114","DOI":"10.26493\/1855-3974.1740.803"},{"key":"1814_CR18","volume-title":"Spectral Radius of Graphs","author":"D Stevanovi\u0107","year":"2015","unstructured":"Stevanovi\u0107 D (2015) Spectral Radius of Graphs. Elsevier, Amsterdam"},{"key":"1814_CR19","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0166-218X(82)90033-6","volume":"4","author":"T Zaslavsky","year":"1982","unstructured":"Zaslavsky T (1982) Signed graphs. Discrete Appl Math 4:47\u201374","journal-title":"Discrete Appl Math"},{"key":"1814_CR20","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/0095-8956(89)90063-4","volume":"47","author":"T Zaslavsky","year":"1989","unstructured":"Zaslavsky T (1989) Biased graphs, I: Bias, balance, and gains. J Combin Theory B 47:32\u201352","journal-title":"J Combin Theory B"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-022-01814-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-022-01814-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-022-01814-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,18]],"date-time":"2022-04-18T18:11:31Z","timestamp":1650305491000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-022-01814-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,24]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["1814"],"URL":"https:\/\/doi.org\/10.1007\/s40314-022-01814-5","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"value":"2238-3603","type":"print"},{"value":"1807-0302","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,24]]},"assertion":[{"value":"16 May 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 December 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 February 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 March 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"118"}}