{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T08:20:41Z","timestamp":1773130841443,"version":"3.50.1"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,3,1]],"date-time":"2010-03-01T00:00:00Z","timestamp":1267401600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2010,3]]},"DOI":"10.1007\/s00493-010-2516-0","type":"journal-article","created":{"date-parts":[[2010,9,16]],"date-time":"2010-09-16T08:27:14Z","timestamp":1284625634000},"page":"125-137","source":"Crossref","is-referenced-by-count":28,"title":["On a poset of trees"],"prefix":"10.1007","volume":"30","author":[{"given":"P\u00e9ter","family":"Csikv\u00e1ri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,9,17]]},"reference":[{"key":"2516_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/net.3230230103","volume":"23","author":"J. Brown","year":"1993","unstructured":"J. Brown, C. Colbourn and J. Devitt: Network transformations and bounding network reliability, Networks 23 (1993), 1\u201317.","journal-title":"Networks"},{"key":"2516_CR2","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0024-3795(85)90092-8","volume":"65","author":"R. A. Brualdi","year":"1985","unstructured":"R. A. Brualdi and A. J. Hoffman: On the spectral radius of (0,1) matrices, Linear Algebra and its Applications 65 (1985), 133\u2013146.","journal-title":"Linear Algebra and its Applications"},{"issue":"1","key":"2516_CR3","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/j.laa.2007.06.020","volume":"427","author":"J. A. Pe\u00f1a de la","year":"2007","unstructured":"J. A. de la Pe\u00f1a, I. Gutnam and J. Rada: Estimating the Estrada index, Linear Algebra and its Applications 427(1) (2007), 70\u201376.","journal-title":"Linear Algebra and its Applications"},{"issue":"3","key":"2516_CR4","first-page":"599","volume":"62","author":"H. Deng","year":"2009","unstructured":"H. Deng: A proof of a conjecture on the Estrada index, MATCH Commun. Math. Comput. Chem. 62(3) (2009), 599\u2013606.","journal-title":"MATCH Commun. Math. Comput. Chem."},{"key":"2516_CR5","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BF01904874","volume":"37","author":"A. K. Kelmans","year":"1981","unstructured":"A. K. Kelmans: On graphs with randomly deleted edges, Acta. Math. Acad. Sci. Hung. 37 (1981), 77\u201388.","journal-title":"Acta. Math. Acad. Sci. Hung."},{"key":"2516_CR6","unstructured":"L. Lov\u00e1sz: Combinatorial problems and exercises, North Holland, 2nd ed., (1993) (Problem 6.23)."},{"key":"2516_CR7","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/BF02018473","volume":"3","author":"L. Lov\u00e1sz","year":"1973","unstructured":"L. Lov\u00e1sz and J. Pelik\u00e1n: On the eigenvalues of trees, Per. Mathematica Hungarica 3 (1973), 175\u2013182.","journal-title":"Per. Mathematica Hungarica"},{"key":"2516_CR8","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1017\/S0963548301004928","volume":"11","author":"V. Nikiforov","year":"2001","unstructured":"V. Nikiforov: Some inequalities for the largest eigenvalue of a graph, Combinatorics, Probability and Computing 11 (2001), 179\u2013189.","journal-title":"Combinatorics, Probability and Computing"},{"issue":"2\u20133","key":"2516_CR9","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/j.laa.2007.07.010","volume":"427","author":"V. Nikiforov","year":"2007","unstructured":"V. Nikiforov: Bounds on graph eigenvalues II, Linear Algebra and its Applications 427(2\u20133) (2007), 183\u2013189. Available at http:\/\/arxiv.org\/abs\/math.CO\/0612461 .","journal-title":"Linear Algebra and its Applications"},{"key":"2516_CR10","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0024-3795(83)90131-3","volume":"110","author":"P. Rowlinson","year":"1988","unstructured":"P. Rowlinson: On the maximal index of graphs with a prescribed number of edges, Linear Algebra and its Applications 110 (1988), 43\u201353.","journal-title":"Linear Algebra and its Applications"},{"key":"2516_CR11","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1002\/net.3230220206","volume":"22","author":"A. Satyanarayana","year":"1992","unstructured":"A. Satyanarayana, L. Schoppman and C. L. Suffel: A reliability-improving graph transformation with applications to network reliability, Networks 22 (1992), 209\u2013216.","journal-title":"Networks"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-010-2516-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-010-2516-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-010-2516-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,4]],"date-time":"2019-06-04T20:38:05Z","timestamp":1559680685000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-010-2516-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,3]]}},"alternative-id":["2516"],"URL":"https:\/\/doi.org\/10.1007\/s00493-010-2516-0","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,3]]}}}