{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,18]],"date-time":"2024-07-18T15:54:11Z","timestamp":1721318051546},"reference-count":7,"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":[[2011,3]]},"abstract":"<jats:p> In this paper, we determine all the extremal tricyclic graphs with minimum degree distance. <\/jats:p>","DOI":"10.1142\/s1793830911000985","type":"journal-article","created":{"date-parts":[[2011,4,14]],"date-time":"2011-04-14T09:45:47Z","timestamp":1302774347000},"page":"25-32","source":"Crossref","is-referenced-by-count":6,"title":["A NOTE ON TRICYCLIC GRAPHS WITH MINIMUM DEGREE DISTANCE"],"prefix":"10.1142","volume":"03","author":[{"given":"WEI","family":"ZHU","sequence":"first","affiliation":[{"name":"Department of Mathematics, Qinghai Nationalities University, Xining, Qinghai 810007, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"SHENGBIAO","family":"HU","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Qinghai Nationalities University, Xining, Qinghai 810007, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"HAICHENG","family":"MA","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Qinghai Nationalities University, Xining, Qinghai 810007, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2012,4,5]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1021\/ci00021a008"},{"key":"rf2","first-page":"264","volume":"11","author":"Erd\u00f6s P.","journal-title":"Mat. Lapok"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1021\/ci00021a009"},{"key":"rf4","series-title":"Canadian Mathematical Monographs","volume-title":"Counting Labelled Trees","volume":"1","author":"Moon J. W.","year":"1970"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.2307\/2372318"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(99)00117-1"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2007.09.010"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830911000985","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T01:32:17Z","timestamp":1565141537000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830911000985"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3]]},"references-count":7,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2012,4,5]]},"published-print":{"date-parts":[[2011,3]]}},"alternative-id":["10.1142\/S1793830911000985"],"URL":"https:\/\/doi.org\/10.1142\/s1793830911000985","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,3]]}}}