{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T08:59:21Z","timestamp":1766048361348},"reference-count":12,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2012,12]]},"abstract":"<jats:p> Bicyclic graphs are connected graphs in which the number of edges equals the number of vertices plus one. Let P<jats:sub>p+1<\/jats:sub> = x<jats:sub>1<\/jats:sub>x<jats:sub>2<\/jats:sub>\u22efx<jats:sub>p+1<\/jats:sub>, P<jats:sub>t+1<\/jats:sub> = y<jats:sub>1<\/jats:sub>y<jats:sub>2<\/jats:sub>\u22efy<jats:sub>t+1<\/jats:sub> and P<jats:sub>q+1<\/jats:sub> = z<jats:sub>1<\/jats:sub>z<jats:sub>2<\/jats:sub>\u22efz<jats:sub>q+1<\/jats:sub> be three vertex-disjoint paths. Identifying the initial vertices as u<jats:sub>0<\/jats:sub> and the terminal vertices as v<jats:sub>0<\/jats:sub>, the resultant graph, denoted by \u03b8(p; t; q), is called a \u03b8-graph. Let [Formula: see text] be the class of all bicyclic graphs on n vertices, which contain a \u03b8-graph as an induced subgraph. In this paper, we study the distance spectral radius of bicyclic graphs in [Formula: see text], and determine the graph with the largest distance spectral radius. <\/jats:p>","DOI":"10.1142\/s1793830912500619","type":"journal-article","created":{"date-parts":[[2012,12,11]],"date-time":"2012-12-11T03:32:23Z","timestamp":1355196743000},"page":"1250061","source":"Crossref","is-referenced-by-count":7,"title":["ON THE MAXIMAL DISTANCE SPECTRAL RADIUS IN A CLASS OF BICYCLIC GRAPHS"],"prefix":"10.1142","volume":"04","author":[{"given":"SOMNATH","family":"PAUL","sequence":"first","affiliation":[{"name":"Department of Mathematical Sciences, Tezpur University, Tezpur 784028, India"}]}],"member":"219","published-online":{"date-parts":[[2013,1,4]]},"reference":[{"key":"rf1","volume-title":"Spectra of Graphs \u2014 Theory and Application","author":"Cvetkovi\u0107 D.","year":"1995"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(76)90003-0"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1137\/0205006"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1016\/0001-8708(78)90005-1"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1971.tb02618.x"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190140309"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2011.07.031"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1080\/03081089008818032"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.13001\/1081-3810.1366"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1016\/j.aml.2008.11.007"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2011.05.040"},{"key":"rf12","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\/S1793830912500619","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T17:14:40Z","timestamp":1565111680000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830912500619"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,12]]},"references-count":12,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2013,1,4]]},"published-print":{"date-parts":[[2012,12]]}},"alternative-id":["10.1142\/S1793830912500619"],"URL":"https:\/\/doi.org\/10.1142\/s1793830912500619","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,12]]}}}