{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T10:38:59Z","timestamp":1648895939699},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2012,4,20]],"date-time":"2012-04-20T00:00:00Z","timestamp":1334880000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2013,9]]},"DOI":"10.1007\/s00373-012-1178-7","type":"journal-article","created":{"date-parts":[[2012,4,19]],"date-time":"2012-04-19T10:16:22Z","timestamp":1334830582000},"page":"1287-1304","source":"Crossref","is-referenced-by-count":0,"title":["Iterated Joining of Rooted Trees"],"prefix":"10.1007","volume":"29","author":[{"given":"Paolo","family":"Dulio","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Virgilio","family":"Pannone","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,4,20]]},"reference":[{"key":"1178_CR1","volume-title":"Distance in Graphs","author":"F. Buckley","year":"1990","unstructured":"Buckley F., Harary F.: Distance in Graphs. Addison-Wesley, Boston (1990)"},{"issue":"2","key":"1178_CR2","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1002\/jgt.3190140202","volume":"14","author":"A.A. Dobrynin","year":"1990","unstructured":"Dobrynin A.A.: Regular graphs having the same path layer matrix. J. Graph Theory 14(2), 141\u2013148 (1990)","journal-title":"J. Graph Theory"},{"key":"1178_CR3","unstructured":"Dulio, P., Pannone, V. Trees with the same path-table. Le Matematiche, (Catania) 60(1), 59\u201365 (2005)"},{"key":"1178_CR4","unstructured":"Dulio, P., Pannone, V.: Trees with path-stable center. Ars Combinatoria LXXX, 153\u2013175 (2006)"},{"issue":"7","key":"1178_CR5","doi-asserted-by":"crossref","first-page":"1185","DOI":"10.1016\/j.disc.2007.04.006","volume":"308","author":"P. Dulio","year":"2008","unstructured":"Dulio P., Pannone V.: Joining caterpillars and stability of the tree center. Discret. Math. 308(7), 1185\u20131190 (2008)","journal-title":"Discret. Math."},{"issue":"8-9","key":"1178_CR6","doi-asserted-by":"crossref","first-page":"827","DOI":"10.1016\/j.disc.2006.01.022","volume":"306","author":"D. Eisenstat","year":"2006","unstructured":"Eisenstat D., Gordon G.: Non-isomorphic caterpillars with identical subtree data. Discret. Math. 306(8-9), 827\u2013830 (2006)","journal-title":"Discret. Math."},{"issue":"1\u20133","key":"1178_CR7","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0012-365X(94)00278-Q","volume":"147","author":"G. Gordon","year":"1995","unstructured":"Gordon G., McDonnell E.: Trees with the same degree sequence and path numbers. Discret. Math. 147(1\u20133), 297\u2013300 (1995)","journal-title":"Discret. Math."},{"issue":"4","key":"1178_CR8","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1007\/PL00007229","volume":"16","author":"D. Mubayi","year":"2000","unstructured":"Mubayi D., West D.B.: On the number of vertices with specified eccentricity. Graphs Combin. 16(4), 441\u2013452 (2000)","journal-title":"Graphs Combin."},{"issue":"1-3","key":"1178_CR9","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/S0012-365X(00)00030-3","volume":"220","author":"E. Prisner","year":"2000","unstructured":"Prisner E.: Eccentricity-approximating trees in chordal graphs. Discret. Math. 220(1-3), 263\u2013269 (2000)","journal-title":"Discret. Math."},{"key":"1178_CR10","first-page":"5","volume":"7","author":"M. Randi\u010d","year":"1979","unstructured":"Randi\u010d M.: Characterizations of atoms, molecules, and classes of molecules based on path enumerations. MATCH 7, 5\u201364 (1979)","journal-title":"MATCH"},{"issue":"1","key":"1178_CR11","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1002\/jgt.3190060111","volume":"6","author":"P.J. Slater","year":"1982","unstructured":"Slater P.J.: Counterexamples to Randi\u010d\u2019s conjecture on distance degree sequences for trees. J. Graph Theory 6(1), 89\u201392 (1982)","journal-title":"J. Graph Theory"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1178-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-012-1178-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1178-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:59:33Z","timestamp":1559055573000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-012-1178-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,4,20]]},"references-count":11,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2013,9]]}},"alternative-id":["1178"],"URL":"https:\/\/doi.org\/10.1007\/s00373-012-1178-7","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,4,20]]}}}