{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T05:27:15Z","timestamp":1767245235168},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,2,20]],"date-time":"2020-02-20T00:00:00Z","timestamp":1582156800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,2,20]],"date-time":"2020-02-20T00:00:00Z","timestamp":1582156800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2020,5]]},"DOI":"10.1007\/s40314-020-1119-7","type":"journal-article","created":{"date-parts":[[2020,2,20]],"date-time":"2020-02-20T09:02:37Z","timestamp":1582189357000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["The minimal-ABC trees with $$B_2$$-branches"],"prefix":"10.1007","volume":"39","author":[{"given":"Zhibin","family":"Du","sequence":"first","affiliation":[]},{"given":"Darko","family":"Dimitrov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,2,20]]},"reference":[{"key":"1119_CR1","first-page":"713","volume":"65","author":"J Chen","year":"2011","unstructured":"Chen J, Guo X (2011) Extreme atom-bond connectivity index of graphs. MATCH Commun Math Comput Chem 65:713\u2013722","journal-title":"MATCH Commun Math Comput Chem"},{"key":"1119_CR2","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1016\/j.cplett.2011.06.049","volume":"511","author":"KC Das","year":"2011","unstructured":"Das KC, Gutman I, Furtula B (2011) On atom-bond connectivity index. Chem Phys Lett 511:452\u2013454","journal-title":"Chem Phys Lett"},{"key":"1119_CR3","first-page":"159","volume":"76","author":"KC Das","year":"2016","unstructured":"Das KC, Mohammed MA, Gutman I, Atan KA (2016) Comparison between atom-bond connectivity indices of graphs. MATCH Commun Math Comput Chem 76:159\u2013170","journal-title":"MATCH Commun Math Comput Chem"},{"key":"1119_CR4","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.dam.2014.03.009","volume":"172","author":"D Dimitrov","year":"2014","unstructured":"Dimitrov D (2014) On structural properties of trees with minimal atom-bond connectivity index. Discrete Appl Math 172:28\u201344","journal-title":"Discrete Appl Math"},{"key":"1119_CR5","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/j.dam.2015.10.010","volume":"204","author":"D Dimitrov","year":"2016","unstructured":"Dimitrov D (2016) On structural properties of trees with minimal atom-bond connectivity index II\u2014Bounds on $$B_1$$- and $$B_2$$-branches. Discrete Appl Math 204:90\u2013116","journal-title":"Discrete Appl Math"},{"key":"1119_CR6","first-page":"418","volume":"313","author":"D Dimitrov","year":"2017","unstructured":"Dimitrov D (2017) On structural properties of trees with minimal atom-bond connectivity index IV: solving a conjecture about the pendent paths of length three. Appl Math Comput 313:418\u2013430","journal-title":"Appl Math Comput"},{"key":"1119_CR7","first-page":"431","volume":"79","author":"D Dimitrov","year":"2018","unstructured":"Dimitrov D, Milosavljevi\u0107 N (2018) Efficient computation of trees with minimal atom-bond connectivity index revisited. MATCH Commun Math Comput Chem 79:431\u2013450","journal-title":"MATCH Commun Math Comput Chem"},{"key":"1119_CR8","first-page":"276","volume":"282","author":"D Dimitrov","year":"2016","unstructured":"Dimitrov D, Du Z, da Fonseca CM (2016) On structural properties of trees with minimal atom-bond connectivity index III: trees with pendent paths of length three. Appl Math Comput 282:276\u2013290","journal-title":"Appl Math Comput"},{"key":"1119_CR9","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1016\/j.dam.2017.01.019","volume":"222","author":"D Dimitrov","year":"2017","unstructured":"Dimitrov D, Ikica B, \u0160krekovski R (2017) Remarks on maximum atom-bond connectivity index with given graph parameters. Discrete Appl Math 222:222\u2013226","journal-title":"Discrete Appl Math"},{"key":"1119_CR10","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/j.dam.2017.11.003","volume":"236","author":"D Dimitrov","year":"2018","unstructured":"Dimitrov D, Du Z, da Fonseca CM (2018) Some forbidden combinations of branches in minimal-ABC trees. Discrete Appl Math 236:165\u2013182","journal-title":"Discrete Appl Math"},{"key":"1119_CR11","doi-asserted-by":"publisher","first-page":"e0195153","DOI":"10.1371\/journal.pone.0195153","volume":"13","author":"D Dimitrov","year":"2018","unstructured":"Dimitrov D, Du Z, da Fonseca CM (2018) The minimal-ABC trees with $$B_1$$-branches. PLoS One 13:e0195153","journal-title":"PLoS One"},{"key":"1119_CR12","doi-asserted-by":"publisher","first-page":"66350","DOI":"10.1109\/ACCESS.2018.2879121","volume":"6","author":"Z Du","year":"2018","unstructured":"Du Z, Dimitrov D (2018) The minimal-ABC trees with $$B_1$$-branches II. IEEE Access 6:66350\u201366366","journal-title":"IEEE Access"},{"key":"1119_CR13","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.dam.2015.08.017","volume":"202","author":"Z Du","year":"2016","unstructured":"Du Z, da Fonseca CM (2016) On a family of trees with minimal atom-bond connectivity index. Discrete Appl Math 202:37\u201349","journal-title":"Discrete Appl Math"},{"key":"1119_CR14","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1016\/j.cplett.2008.08.074","volume":"463","author":"E Estrada","year":"2008","unstructured":"Estrada E (2008) Atom-bond connectivity and the energetic of branched alkanes. Chem Phys Lett 463:422\u2013425","journal-title":"Chem Phys Lett"},{"key":"1119_CR15","first-page":"849","volume":"37A","author":"E Estrada","year":"1998","unstructured":"Estrada E, Torres L, Rodr\u00edguez L, Gutman I (1998) An atom-bond connectivity index: modelling the enthalpy of formation of alkanes. Indian J Chem 37A:849\u2013855","journal-title":"Indian J Chem"},{"key":"1119_CR16","doi-asserted-by":"publisher","first-page":"2828","DOI":"10.1016\/j.dam.2009.03.004","volume":"157","author":"B Furtula","year":"2009","unstructured":"Furtula B, Graovac A, Vuki\u010devi\u0107 D (2009) Atom-bond connectivity index of trees. Discrete Appl Math 157:2828\u20132835","journal-title":"Discrete Appl Math"},{"key":"1119_CR17","first-page":"137","volume":"68","author":"L Gan","year":"2012","unstructured":"Gan L, Liu B, You Z (2012) The ABC index of trees with given degree sequence. MATCH Commun Math Comput Chem 68:137\u2013145","journal-title":"MATCH Commun Math Comput Chem"},{"key":"1119_CR18","first-page":"141","volume":"76","author":"Y Gao","year":"2016","unstructured":"Gao Y, Shao Y (2016) The smallest ABC index of trees with n pendent vertices. MATCH Commun Math Comput Chem 76:141\u2013158","journal-title":"MATCH Commun Math Comput Chem"},{"key":"1119_CR19","first-page":"131","volume":"68","author":"I Gutman","year":"2012","unstructured":"Gutman I, Furtula B (2012) Trees with smallest atom-bond connectivity index. MATCH Commun Math Comput Chem 68:131\u2013136","journal-title":"MATCH Commun Math Comput Chem"},{"key":"1119_CR20","first-page":"467","volume":"67","author":"I Gutman","year":"2012","unstructured":"Gutman I, Furtula B, Ivanovi\u0107 M (2012) Notes on trees with minimal atom-bond connectivity index. MATCH Commun Math Comput Chem 67:467\u2013482","journal-title":"MATCH Commun Math Comput Chem"},{"key":"1119_CR21","doi-asserted-by":"publisher","first-page":"1075","DOI":"10.2298\/FIL1306075G","volume":"27","author":"I Gutman","year":"2013","unstructured":"Gutman I, Furtula B, Ahmadi MB, Hosseini SA, Nowbandegani PS, Zarrinderakht M (2013) The ABC index conundrum. Filomat 27:1075\u20131083","journal-title":"Filomat"},{"key":"1119_CR22","first-page":"5","volume":"71","author":"SA Hosseini","year":"2014","unstructured":"Hosseini SA, Ahmadi MB, Gutman I (2014) Kragujevac trees with minimal atom-bond connectivity index. MATCH Commun Math Comput Chem 71:5\u201320","journal-title":"MATCH Commun Math Comput Chem"},{"key":"1119_CR23","first-page":"549","volume":"69","author":"W Lin","year":"2013","unstructured":"Lin W, Lin X, Gao T, Wu X (2013) Proving a conjecture of Gutman concerning trees with minimal ABC index. MATCH Commun Math Comput Chem 69:549\u2013557","journal-title":"MATCH Commun Math Comput Chem"},{"key":"1119_CR24","first-page":"131","volume":"76","author":"W Lin","year":"2016","unstructured":"Lin W, Chen J, Ma C, Zhang Y, Chen J, Zhang D, Jia F (2016) On trees with minimal ABC index among trees with given number of leaves. MATCH Commun Math Comput Chem 76:131\u2013140","journal-title":"MATCH Commun Math Comput Chem"},{"key":"1119_CR25","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/j.cam.2017.12.027","volume":"338","author":"W Lin","year":"2018","unstructured":"Lin W, Chen J, Wu Z, Dimitrov D, Huang L (2018) Computer search for large trees with minimal ABC index. Appl Math Comput 338:221\u2013230","journal-title":"Appl Math Comput"},{"key":"1119_CR26","first-page":"609208","volume":"2014","author":"J Liu","year":"2014","unstructured":"Liu J, Chen J (2014) Further properties of trees with minimal atom-bond connectivity index. Abstr Appl Anal 2014:609208","journal-title":"Abstr Appl Anal"},{"key":"1119_CR27","doi-asserted-by":"publisher","first-page":"3407","DOI":"10.1016\/j.disc.2007.06.026","volume":"308","author":"H Wang","year":"2008","unstructured":"Wang H (2008) Extremal trees with given degree sequence for the Randi\u0107 index. Discrete Math 308:3407\u20133411","journal-title":"Discrete Math"},{"key":"1119_CR28","doi-asserted-by":"publisher","first-page":"683","DOI":"10.2298\/FIL1204683X","volume":"26","author":"R Xing","year":"2012","unstructured":"Xing R, Zhou B (2012) Extremal trees with fixed degree sequence for atom-bond connectivity index. Filomat 26:683\u2013688","journal-title":"Filomat"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-020-1119-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s40314-020-1119-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-020-1119-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,19]],"date-time":"2021-02-19T19:30:28Z","timestamp":1613763028000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s40314-020-1119-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,20]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,5]]}},"alternative-id":["1119"],"URL":"https:\/\/doi.org\/10.1007\/s40314-020-1119-7","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"value":"2238-3603","type":"print"},{"value":"1807-0302","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,2,20]]},"assertion":[{"value":"12 August 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 May 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 May 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 February 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"85"}}