{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,12]],"date-time":"2025-05-12T13:47:51Z","timestamp":1747057671717},"reference-count":12,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2020,4]]},"abstract":"<jats:p> Let [Formula: see text] be the set of all unbalanced unicyclic graphs of order [Formula: see text] and girth at least [Formula: see text]. In this paper, we determine the signed graph whose largest eigenvalue is maximal among all graphs in [Formula: see text]. <\/jats:p>","DOI":"10.1142\/s1793830920500160","type":"journal-article","created":{"date-parts":[[2019,11,29]],"date-time":"2019-11-29T03:32:33Z","timestamp":1574998353000},"page":"2050016","source":"Crossref","is-referenced-by-count":4,"title":["Maximizing the largest eigenvalues of signed unicyclic graphs"],"prefix":"10.1142","volume":"12","author":[{"given":"M.","family":"Souri","sequence":"first","affiliation":[{"name":"Department of Mathematics, Karaj Branch, Islamic Azad University, Karaj, Iran"}]},{"given":"F.","family":"Heydari","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Karaj Branch, Islamic Azad University, Karaj, Iran"}]},{"given":"M.","family":"Maghasedi","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Karaj Branch, Islamic Azad University, Karaj, Iran"}]}],"member":"219","published-online":{"date-parts":[[2020,1,21]]},"reference":[{"key":"S1793830920500160BIB001","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2018.05.012"},{"key":"S1793830920500160BIB002","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2019.06.016"},{"key":"S1793830920500160BIB003","doi-asserted-by":"publisher","DOI":"10.1080\/03081087.2017.1403548"},{"key":"S1793830920500160BIB004","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2010.05.010"},{"key":"S1793830920500160BIB005","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2006.01.008"},{"key":"S1793830920500160BIB006","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2015.04.022"},{"key":"S1793830920500160BIB007","volume-title":"Spectra of Graphs \u2014 Theory and Application","author":"Cvetkovi\u0107 D. M.","year":"1995","edition":"3"},{"key":"S1793830920500160BIB008","volume-title":"An Introduction to the Theory of Graph Spectra","author":"Cvetkovi\u0107 D. M.","year":"2010"},{"key":"S1793830920500160BIB009","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2008.03.012"},{"key":"S1793830920500160BIB010","doi-asserted-by":"publisher","DOI":"10.1080\/03081087.2016.1265480"},{"key":"S1793830920500160BIB011","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2013.07.007"},{"key":"S1793830920500160BIB012","series-title":"Ramanujan Mathematical Society Lectures Notes Series","first-page":"207","volume-title":"Advances in Discrete Mathematics and Applications","volume":"13","author":"Zaslavsky T.","year":"2010"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830920500160","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,18]],"date-time":"2020-05-18T06:00:28Z","timestamp":1589781628000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830920500160"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,21]]},"references-count":12,"journal-issue":{"issue":"02","published-print":{"date-parts":[[2020,4]]}},"alternative-id":["10.1142\/S1793830920500160"],"URL":"https:\/\/doi.org\/10.1142\/s1793830920500160","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,1,21]]}}}