乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,3]],"date-time":"2024-07-03T10:26:54Z","timestamp":1720002414439},"reference-count":28,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T00:00:00Z","timestamp":1572566400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11271149","11671164","245307"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000893","name":"Simons Foundation","doi-asserted-by":"publisher","award":["11271149","11671164","245307"],"id":[{"id":"10.13039\/100000893","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Applied Mathematics and Computation"],"published-print":{"date-parts":[[2019,11]]},"DOI":"10.1016\/j.amc.2019.05.023","type":"journal-article","created":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T22:42:58Z","timestamp":1559774578000},"page":"232-245","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["Some extremal ratios of the distance and subtree problems in binary trees"],"prefix":"10.1016","volume":"361","author":[{"ORCID":"http:\/\/orcid.org\/0000-0002-6856-0827","authenticated-orcid":false,"given":"Shuchao","family":"Li","sequence":"first","affiliation":[]},{"given":"Hua","family":"Wang","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0001-9296-6870","authenticated-orcid":false,"given":"Shujing","family":"Wang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.amc.2019.05.023_bib0001","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/S0166-218X(97)00068-1","article-title":"Extremal values for ratios of distances in trees","volume":"80","author":"Barefoot","year":"1997","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.amc.2019.05.023_bib0002","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/j.dam.2018.08.033","article-title":"Sum of weighted distances in trees","volume":"257","author":"Cai","year":"2019","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.amc.2019.05.023_bib0003","first-page":"435","article-title":"On distances in vertex-weighted trees","volume":"333","author":"Cai","year":"2018","journal-title":"Appl. Math. Comput."},{"key":"10.1016\/j.amc.2019.05.023_bib0004","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1016\/j.disopt.2011.02.002","article-title":"The wiener maximum quadratic assignment problem","volume":"8","author":"Cela","year":"2011","journal-title":"Discrete Optim."},{"issue":"3","key":"10.1016\/j.amc.2019.05.023_bib0005","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1023\/A:1010767517079","article-title":"Wiener index of trees: Theory and applications","volume":"66","author":"Dobrynin","year":"2001","journal-title":"Acta Appl. Math."},{"issue":"101","key":"10.1016\/j.amc.2019.05.023_bib0006","doi-asserted-by":"crossref","first-page":"283","DOI":"10.21136\/CMJ.1976.101401","article-title":"Distance in graphs","volume":"26","author":"Entringer","year":"1976","journal-title":"Czechoslovak Math. J."},{"issue":"1\u20133","key":"10.1016\/j.amc.2019.05.023_bib0007","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/S0166-218X(01)00357-2","article-title":"Wiener index versus maximum degree in trees","volume":"122","author":"Fischermann","year":"2002","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"10.1016\/j.amc.2019.05.023_bib0008","doi-asserted-by":"crossref","first-page":"985","DOI":"10.1137\/070687736","article-title":"Largest number of subtrees of trees with a given maximum degree","volume":"22","author":"Kirk","year":"2008","journal-title":"SIAM J. Discrete Math."},{"issue":"2\u20133","key":"10.1016\/j.amc.2019.05.023_bib0009","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/S0166-218X(02)00195-6","article-title":"Superdominance order and distance of trees with bounded maximum degree","volume":"125","author":"Jelen","year":"2003","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.amc.2019.05.023_bib0010","first-page":"185","article-title":"Sur les assemblages de lignes","volume":"70","author":"Jordan","year":"1869","journal-title":"J. Reine Angew. Math."},{"key":"10.1016\/j.amc.2019.05.023_bib0011","series-title":"Optimal Multiple Parsimony Alignment with Affine Gap Cost Using a Phylogenetic Tree","first-page":"433","volume":"2812","author":"Knudsen","year":"2003"},{"key":"10.1016\/j.amc.2019.05.023_bib0012","first-page":"445","article-title":"Vertex-based and edge-based centroids of graphs","volume":"331","author":"Lan","year":"2018","journal-title":"Appl. Math. Comput."},{"issue":"4","key":"10.1016\/j.amc.2019.05.023_sbref0013","doi-asserted-by":"crossref","first-page":"14","DOI":"10.37236\/2186","article-title":"Further analysis on the total number of subtrees of trees","volume":"19","author":"Li","year":"2012","journal-title":"Electron. J. Combin."},{"key":"10.1016\/j.amc.2019.05.023_bib0014","series-title":"Combinatorial Problems and Exercises","author":"Lov\u00e1sz","year":"1993"},{"issue":"1","key":"10.1016\/j.amc.2019.05.023_bib0015","first-page":"273","article-title":"Greedy trees, caterpillars, and wiener-type graph invariants","volume":"68","author":"Schmuck","year":"2012","journal-title":"MATCH Commun.Math.Comput.Chem."},{"key":"10.1016\/j.amc.2019.05.023_bib0016","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1016\/j.aam.2004.07.002","article-title":"On subtrees of trees","volume":"34","author":"Sz\u00e9kely","year":"2005","journal-title":"Adv. Appl. Math."},{"key":"10.1016\/j.amc.2019.05.023_bib0017","first-page":"147","article-title":"Binary trees with the largest number of subtrees with at least one leaf","volume":"177","author":"Sz\u00e9kely","year":"2005","journal-title":"Congr. Numer."},{"issue":"3","key":"10.1016\/j.amc.2019.05.023_bib0018","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1016\/j.dam.2006.05.008","article-title":"Binary trees with the largest number of subtrees","volume":"155","author":"Sz\u00e9kely","year":"2006","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"10.1016\/j.amc.2019.05.023_sbref0019","doi-asserted-by":"crossref","first-page":"20","DOI":"10.37236\/3020","article-title":"Extremal values of ratios: distance problems vs. subtree problems in trees","volume":"20","author":"Sz\u00e9kely","year":"2013","journal-title":"Electronic J. Combin."},{"key":"10.1016\/j.amc.2019.05.023_bib0020","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/j.disc.2013.12.027","article-title":"Extremal values of ratios: distance problems vs. subtree problems in trees II","volume":"322","author":"Sz\u00e9kely","year":"2014","journal-title":"Discrete Math."},{"issue":"1","key":"10.1016\/j.amc.2019.05.023_bib0021","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1137\/050631446","article-title":"Correlation of graph-theoretical indices","volume":"21","author":"Wagner","year":"2007","journal-title":"SIAM J. Discrete Math."},{"issue":"14","key":"10.1016\/j.amc.2019.05.023_sbref0022","doi-asserted-by":"crossref","first-page":"2647","DOI":"10.1016\/j.dam.2007.11.005","article-title":"The extremal values of the wiener index of a tree with given degree sequence","volume":"156","author":"Wang","year":"2008","journal-title":"Discrete Appl. Math."},{"issue":"69","key":"10.1016\/j.amc.2019.05.023_bib0023","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1021\/ja01193a005","article-title":"Structural determination of paraffin boiling points","volume":"1","author":"Wiener","year":"1947","journal-title":"J. Am. Chem. Soc."},{"key":"10.1016\/j.amc.2019.05.023_bib0024","first-page":"87","article-title":"Medians and peripherans of trees","volume":"4","author":"Zelinka","year":"1968","journal-title":"Arch. Math. (Brno)"},{"key":"10.1016\/j.amc.2019.05.023_bib0025","first-page":"623","article-title":"The wiener index of trees with given degree sequences","volume":"60","author":"Zhang","year":"2008","journal-title":"MATCH Commun. Math. Comput. Chem."},{"key":"10.1016\/j.amc.2019.05.023_bib0026","first-page":"661","article-title":"Maximum wiener index of trees with given degree sequence","volume":"64","author":"Zhang","year":"2010","journal-title":"MATCH Commun. Math. Comput. Chem."},{"issue":"3","key":"10.1016\/j.amc.2019.05.023_bib0027","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1002\/jgt.21674","article-title":"The number of subtrees of trees with given degree sequence","volume":"73","author":"Zhang","year":"2013","journal-title":"J. Graph Theory"},{"issue":"2","key":"10.1016\/j.amc.2019.05.023_bib0028","first-page":"207","article-title":"Trees with the most subtrees\u2014an algorithmic approach","volume":"3","author":"Zhang","year":"2012","journal-title":"J. Comb."}],"container-title":["Applied Mathematics and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0096300319304163?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0096300319304163?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,5,12]],"date-time":"2021-05-12T19:35:08Z","timestamp":1620848108000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0096300319304163"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11]]},"references-count":28,"alternative-id":["S0096300319304163"],"URL":"https:\/\/doi.org\/10.1016\/j.amc.2019.05.023","relation":{},"ISSN":["0096-3003"],"issn-type":[{"value":"0096-3003","type":"print"}],"subject":[],"published":{"date-parts":[[2019,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Some extremal ratios of the distance and subtree problems in binary trees","name":"articletitle","label":"Article Title"},{"value":"Applied Mathematics and Computation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.amc.2019.05.023","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2019 Elsevier Inc. All rights reserved.","name":"copyright","label":"Copyright"}]}}