{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T09:00:54Z","timestamp":1766048454492},"reference-count":11,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2014,3]]},"abstract":"<jats:p> Bicyclic graphs are connected graphs in which the number of edges equals the number of vertices plus one. The class of bicyclic graphs of order n, denoted by \u212c<jats:sub>n<\/jats:sub>, can be partitioned into two subclasses: the class [Formula: see text] of graphs which contain induced \u221e-graphs, and the class [Formula: see text] of graphs which contain induced \u03b8-graphs. Bose et al. [2] have found the graph having the minimal distance spectral radius in [Formula: see text]. In this paper, we determine the graphs having the minimal distance spectral radius in [Formula: see text]. These results together give a complete characterization of the graphs having the minimal distance spectral radius in \u212c<jats:sub>n<\/jats:sub>. <\/jats:p>","DOI":"10.1142\/s1793830914500141","type":"journal-article","created":{"date-parts":[[2013,11,22]],"date-time":"2013-11-22T01:05:54Z","timestamp":1385082354000},"page":"1450014","source":"Crossref","is-referenced-by-count":2,"title":["ON THE MINIMAL DISTANCE SPECTRAL RADIUS IN THE CLASS OF BICYCLIC GRAPHS"],"prefix":"10.1142","volume":"06","author":[{"given":"MILAN","family":"NATH","sequence":"first","affiliation":[{"name":"Department of Mathematical Sciences, Tezpur University, Tezpur 784028, India"}]},{"given":"SOMNATH","family":"PAUL","sequence":"additional","affiliation":[{"name":"Department of Mathematical Sciences, Tezpur University, Tezpur 784028, India"}]}],"member":"219","published-online":{"date-parts":[[2014,2,18]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2011.04.041"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2012.06.008"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1137\/0205006"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1971.tb02618.x"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2011.07.031"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1080\/03081087.2012.711324"},{"key":"rf7","volume":"4","author":"Paul S.","journal-title":"Discrete Math. Algorithms Appl."},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1080\/03081089008818032"},{"key":"rf9","first-page":"168","volume":"20","author":"Stevanovi\u0107 D.","journal-title":"Electron. J. Linear Algebra"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2011.05.040"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1080\/03081087.2010.499512"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830914500141","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T17:59:39Z","timestamp":1565114379000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830914500141"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,2,18]]},"references-count":11,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2014,2,18]]},"published-print":{"date-parts":[[2014,3]]}},"alternative-id":["10.1142\/S1793830914500141"],"URL":"https:\/\/doi.org\/10.1142\/s1793830914500141","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,2,18]]}}}