{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T00:08:20Z","timestamp":1699834100453},"reference-count":10,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2006,10,3]],"date-time":"2006-10-03T00:00:00Z","timestamp":1159833600000},"content-version":"vor","delay-in-days":8798,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1982,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Using generating functions and asymptotic techniques, the probability that in a large random tree a point is of degree <jats:italic>r<\/jats:italic> and an orbit of size <jats:italic>s<\/jats:italic> for <jats:italic>r<\/jats:italic> \u2264 7 and <jats:italic>s<\/jats:italic> \u2264 7 is calculated. For example, it is found that about 17% of the points of a random tree are fixed and have degree one. This method is readily applied to different types of trees.<\/jats:p>","DOI":"10.1002\/jgt.3190060304","type":"journal-article","created":{"date-parts":[[2007,5,29]],"date-time":"2007-05-29T06:49:39Z","timestamp":1180421379000},"page":"283-293","source":"Crossref","is-referenced-by-count":4,"title":["Distribution of points by degree and orbit size in a large random tree"],"prefix":"10.1002","volume":"6","author":[{"given":"C. K.","family":"Bailey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,3]]},"reference":[{"key":"e_1_2_1_2_2","volume-title":"The Theory and Applications of Graphs","author":"Bailey C. K.","year":"1980"},{"key":"e_1_2_1_3_2","volume-title":"Graphical Enumeration","author":"Harary F.","year":"1973"},{"key":"e_1_2_1_4_2","article-title":"Orbits in random trees","author":"Harary F.","journal-title":"Ann. N. Y. Acad. Sci."},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1017\/S0305004100055857"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02559543"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1017\/S1446788700016190"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.2307\/1969046"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(79)90073-X"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02546665"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(75)90076-X"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190060304","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190060304","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T05:07:47Z","timestamp":1699765667000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190060304"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,9]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1982,9]]}},"alternative-id":["10.1002\/jgt.3190060304"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190060304","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1982,9]]}}}