{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T16:26:53Z","timestamp":1726417613198},"reference-count":47,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2014,9,1]],"date-time":"2014-09-01T00:00:00Z","timestamp":1409529600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Science Foundation of China","doi-asserted-by":"crossref","award":["61174094"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100006606","name":"Natural Science Foundation of Tianjin","doi-asserted-by":"crossref","award":["14JCYBJC18700"],"id":[{"id":"10.13039\/501100006606","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Austrian Science Funds"},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"publisher","award":["2014M551015"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004543","name":"China Scholarship Council","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100004543","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Applied Mathematics and Computation"],"published-print":{"date-parts":[[2014,9]]},"DOI":"10.1016\/j.amc.2014.05.105","type":"journal-article","created":{"date-parts":[[2014,6,22]],"date-time":"2014-06-22T00:45:25Z","timestamp":1403397925000},"page":"462-472","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":25,"special_numbering":"C","title":["Entropy bounds for dendrimers"],"prefix":"10.1016","volume":"242","author":[{"given":"Zengqiang","family":"Chen","sequence":"first","affiliation":[]},{"given":"Matthias","family":"Dehmer","sequence":"additional","affiliation":[]},{"given":"Frank","family":"Emmert-Streib","sequence":"additional","affiliation":[]},{"given":"Yongtang","family":"Shi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"year":"1983","series-title":"Information Theoretic Indices for Characterization of Chemical Structures","author":"Bonchev","key":"10.1016\/j.amc.2014.05.105_b0005"},{"key":"10.1016\/j.amc.2014.05.105_b0010","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1080\/00018730601170527","article-title":"Characterization of complex networks: a survey of measurements","volume":"56","author":"Costa","year":"2007","journal-title":"Adv. Phys."},{"key":"10.1016\/j.amc.2014.05.105_b0015","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1016\/j.amc.2007.12.010","article-title":"Information processing in complex networks: Graph entropy and information functionals","volume":"201","author":"Dehmer","year":"2008","journal-title":"Appl. Math. Comput."},{"year":"1989","series-title":"Graphentheorie","author":"Halin","key":"10.1016\/j.amc.2014.05.105_b0020"},{"year":"2006","series-title":"The Structure and Dynamics of Networks","author":"Newman","key":"10.1016\/j.amc.2014.05.105_b0025"},{"key":"10.1016\/j.amc.2014.05.105_b0030","first-page":"105","article-title":"Metrical analysis of graphs","volume":"23","author":"Skorobogatov","year":"1988","journal-title":"MATCH Commun. Math. Comput. Chem."},{"key":"10.1016\/j.amc.2014.05.105_b0035","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1049\/iet-syb.2010.0025","article-title":"Networks for systems biology: conceptual connection of data and function","volume":"5","author":"Emmert-Streib","year":"2011","journal-title":"IET Syst. Biol."},{"key":"10.1016\/j.amc.2014.05.105_b0040","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1080\/00207728408926559","article-title":"Information theoretical analysis of ecological networks","volume":"15","author":"Hirata","year":"1984","journal-title":"Int. J. Syst. Sci."},{"key":"10.1016\/j.amc.2014.05.105_b0045","series-title":"Knowledge Structures","first-page":"146","article-title":"Operations on cognitive structures-their modeling on the basis of graph theory","author":"Sommerfeld","year":"1994"},{"key":"10.1016\/j.amc.2014.05.105_b0050","doi-asserted-by":"crossref","first-page":"e76942","DOI":"10.1371\/journal.pone.0076942","article-title":"Effect of initial fraction of cooperators on cooperative behavior in evolutionary prisoner\u2019s dilemma game","volume":"8","author":"Shigaki","year":"2013","journal-title":"PLoS One"},{"key":"10.1016\/j.amc.2014.05.105_b0055","doi-asserted-by":"crossref","first-page":"42145","DOI":"10.1103\/PhysRevE.88.042145","article-title":"Insight into the so-called spatial reciprocity","volume":"88","author":"Wang","year":"2013","journal-title":"Phys. Rev. E"},{"issue":"7","key":"10.1016\/j.amc.2014.05.105_b0060","doi-asserted-by":"crossref","first-page":"e40218","DOI":"10.1371\/journal.pone.0040218","article-title":"Inferring reputation promotes the evolution of cooperation in spatial social dilemma games","volume":"7","author":"Wang","year":"2012","journal-title":"PLos One"},{"key":"10.1016\/j.amc.2014.05.105_b0065","doi-asserted-by":"crossref","first-page":"3055","DOI":"10.1038\/srep03055","article-title":"Impact of social punishment on cooperative behavior in complex networks","volume":"3","author":"Wang","year":"2013","journal-title":"Sci. Rep."},{"issue":"24","key":"10.1016\/j.amc.2014.05.105_b0070","doi-asserted-by":"crossref","first-page":"6440","DOI":"10.1016\/j.physa.2012.07.065","article-title":"Evaluating fitness by integrating the highest payoff within the neighborhood promotes cooperation in social dilemmas","volume":"391","author":"Xia","year":"2012","journal-title":"Physica A"},{"issue":"7","key":"10.1016\/j.amc.2014.05.105_b0075","doi-asserted-by":"crossref","first-page":"1577","DOI":"10.1016\/j.physa.2012.11.043","article-title":"Effects of delayed recovery and nonuniform transmission on the spreading of diseases in complex networks","volume":"392","author":"Xia","year":"2013","journal-title":"Physica A"},{"year":"1949","series-title":"The Mathematical Theory of Communication","author":"Shannon","key":"10.1016\/j.amc.2014.05.105_b0080"},{"key":"10.1016\/j.amc.2014.05.105_b0085","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.ins.2010.08.041","article-title":"A history of graph entropy measures","volume":"181","author":"Dehmer","year":"2011","journal-title":"Inf. Sci."},{"key":"10.1016\/j.amc.2014.05.105_b0090","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/BF02477860","article-title":"Life, information theory, and topology","volume":"17","author":"Rasevsky","year":"1955","journal-title":"Bull. Math. Biophys."},{"key":"10.1016\/j.amc.2014.05.105_b0095","first-page":"129","article-title":"A note on the information content of graphs","volume":"18","author":"Trucco","year":"1965","journal-title":"Bull. Math. Biol."},{"issue":"8","key":"10.1016\/j.amc.2014.05.105_b0100","doi-asserted-by":"crossref","first-page":"e3079","DOI":"10.1371\/journal.pone.0003079","article-title":"Entropy bounds for molecular hierarchical networks","volume":"3","author":"Dehmer","year":"2008","journal-title":"PLoS One"},{"issue":"2","key":"10.1016\/j.amc.2014.05.105_b0105","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/j.compbiolchem.2007.09.007","article-title":"Structural information content of net- works: graph entropy based on local vertex functionals","volume":"32","author":"Dehmer","year":"2008","journal-title":"Comput. Biol. Chem."},{"key":"10.1016\/j.amc.2014.05.105_b0110","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/BF02476948","article-title":"Entropy and the complexity of the graphs I: an index of the relative complexity of a graph","volume":"30","author":"Mowshowitz","year":"1968","journal-title":"Bull. Math. Biophys."},{"key":"10.1016\/j.amc.2014.05.105_b0115","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/BF02476692","article-title":"Entropy and the complexity of graphs II: the information content of digraphs and infinite graphs","volume":"30","author":"Mowshowitz","year":"1968","journal-title":"Bull. Math. Biophys."},{"key":"10.1016\/j.amc.2014.05.105_b0120","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/BF02476603","article-title":"Entropy and the complexity of graphs III: graphs with prescribed information content","volume":"30","author":"Mowshowitz","year":"1968","journal-title":"Bull. Math. Biophys."},{"key":"10.1016\/j.amc.2014.05.105_b0125","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1007\/BF02476673","article-title":"Entropy and the complexity of graphs IV: entropy measures and graphical structure","volume":"30","author":"Mowshowitz","year":"1968","journal-title":"Bull. Math. Biophys."},{"year":"2013","series-title":"Advances in Network Complexity","author":"Dehmer","key":"10.1016\/j.amc.2014.05.105_b0130"},{"year":"2006","series-title":"Elements of Information Theory","author":"Cover","key":"10.1016\/j.amc.2014.05.105_b0135"},{"key":"10.1016\/j.amc.2014.05.105_b0140","unstructured":"J. K\u00f6rner, Coding of an information source having ambiguous alphabet and the entropy of graphs, in: Transactions of the 6-th Prague Conference on Information Theory, 1973, pp. 411\u2013425."},{"key":"10.1016\/j.amc.2014.05.105_b0145","doi-asserted-by":"crossref","first-page":"e34523","DOI":"10.1371\/journal.pone.0034523","article-title":"Exploring statistical and population aspects of network complexity","volume":"7","author":"Emmert-Streib","year":"2012","journal-title":"PLoS One"},{"key":"10.1016\/j.amc.2014.05.105_b0150","first-page":"889","article-title":"On extremal properties of graph entropies","volume":"68","author":"Dehmer","year":"2012","journal-title":"MATCH Commun. Math. Comput. Chem."},{"key":"10.1016\/j.amc.2014.05.105_b0155","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/S0020-0190(01)00191-0","article-title":"Entropy lower bounds for quantum decision tree complexity","volume":"81","author":"Shi","year":"2002","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/j.amc.2014.05.105_b0160","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/S0893-9659(97)00028-1","article-title":"Some bounds on entropy measures in information theory","volume":"10","author":"Dragomir","year":"1997","journal-title":"Appl. Math. Lett."},{"year":"2008","series-title":"Inequalities","author":"Hardy","key":"10.1016\/j.amc.2014.05.105_b0165"},{"year":"2011","series-title":"Inequalities: Theory of Majorization and Its Applications","author":"Marshall","key":"10.1016\/j.amc.2014.05.105_b0170"},{"key":"10.1016\/j.amc.2014.05.105_b0175","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/S1874-5229(99)80006-9","article-title":"Molecular topology of dendrimers","volume":"4","author":"Diudea","year":"1999","journal-title":"Adv. Dendritic Macromol."},{"key":"10.1016\/j.amc.2014.05.105_b0180","unstructured":"P. Holister, C.R. Vas, T. Harper, Dendrimers technology white papers Nr. 6, Cientifica 6, 2003, pp. 1\u201315."},{"issue":"1","key":"10.1016\/j.amc.2014.05.105_b0185","doi-asserted-by":"crossref","first-page":"199","DOI":"10.18388\/abp.2001_5127","article-title":"Dendrimers: properties and applications","volume":"48","author":"Klajnert","year":"2001","journal-title":"Acta Biochim. Pol."},{"key":"10.1016\/j.amc.2014.05.105_b0190","doi-asserted-by":"crossref","first-page":"4263","DOI":"10.1016\/j.amc.2009.12.051","article-title":"Inequalities for entropy-based measures of network information content","volume":"215","author":"Dehmer","year":"2010","journal-title":"Appl. Math. Comput."},{"key":"10.1016\/j.amc.2014.05.105_b0195","doi-asserted-by":"crossref","first-page":"4517","DOI":"10.1063\/1.434593","article-title":"Information theory, distance matrix and molecular branching","volume":"67","author":"Bonchev","year":"1977","journal-title":"J. Chem. Phys."},{"key":"10.1016\/j.amc.2014.05.105_b0200","doi-asserted-by":"crossref","first-page":"1655","DOI":"10.1021\/ci900060x","article-title":"On entropy-based molecular descriptors: statistical analysis of real and synthetic chemical structures","volume":"49","author":"Dehmer","year":"2009","journal-title":"J. Chem. Inf. Model."},{"key":"10.1016\/j.amc.2014.05.105_b0205","first-page":"147","article-title":"Uniquely discriminating molecular structures using novel eigenvalue-based descriptors","volume":"67","author":"Dehmer","year":"2012","journal-title":"MATCH Commun. Math. Comput. Chem."},{"key":"10.1016\/j.amc.2014.05.105_b0210","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/j.ins.2014.03.133","article-title":"Extremality of degree-based graph entropies","volume":"278","author":"Cao","year":"2014","journal-title":"Inf. Sci."},{"issue":"2","key":"10.1016\/j.amc.2014.05.105_b0215","doi-asserted-by":"crossref","first-page":"1783","DOI":"10.1016\/j.amc.2007.02.095","article-title":"Information theoretic measures of UHG graphs with low computational complexity","volume":"190","author":"Emmert-Streib","year":"2007","journal-title":"Appl. Math. Comput."},{"key":"10.1016\/j.amc.2014.05.105_b0220","doi-asserted-by":"crossref","first-page":"684","DOI":"10.1080\/08839510802164101","article-title":"Information-theoretic concepts for the analysis of complex networks","volume":"22","author":"Dehmer","year":"2008","journal-title":"Appl. Artif. Intell."},{"key":"10.1016\/j.amc.2014.05.105_b0225","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1002\/cplx.20379","article-title":"Generalized graph entropies","volume":"17","author":"Dehmer","year":"2011","journal-title":"Complexity"},{"key":"10.1016\/j.amc.2014.05.105_b0230","first-page":"547","article-title":"On measures of information and entropy","volume":"vol. 1","author":"R\u00e9nyi","year":"1961"},{"key":"10.1016\/j.amc.2014.05.105_b0235","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF01902599","article-title":"On the measurable solutions of functional equation arising in information theory","volume":"34","author":"Dar\u00f2czy","year":"1979","journal-title":"Acta Math. Acad. Sci. Hungar."}],"container-title":["Applied Mathematics and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0096300314008054?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0096300314008054?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,8,21]],"date-time":"2020-08-21T07:14:23Z","timestamp":1597994063000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0096300314008054"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9]]},"references-count":47,"alternative-id":["S0096300314008054"],"URL":"https:\/\/doi.org\/10.1016\/j.amc.2014.05.105","relation":{},"ISSN":["0096-3003"],"issn-type":[{"type":"print","value":"0096-3003"}],"subject":[],"published":{"date-parts":[[2014,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Entropy bounds for dendrimers","name":"articletitle","label":"Article Title"},{"value":"Applied Mathematics and Computation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.amc.2014.05.105","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2014 Elsevier Inc. All rights reserved.","name":"copyright","label":"Copyright"}]}}