{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T06:52:14Z","timestamp":1699771934831},"reference-count":3,"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":9894,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1979,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The <jats:italic>degree sequence<\/jats:italic> (d<jats:sub>0<\/jats:sub>, <jats:italic>d<\/jats:italic><jats:sub>1<\/jats:sub>, \u2026, <jats:italic>d<\/jats:italic><jats:sub>p\u20101<\/jats:sub>) of a graph <jats:italic>G<\/jats:italic> of order <jats:italic>p<\/jats:italic> is defined by <jats:italic>d<\/jats:italic><jats:sub>k<\/jats:sub> = the number of points of <jats:italic>G<\/jats:italic> of degree <jats:italic>k<\/jats:italic>. Methods of Robinson are extended to produce a generating function <jats:italic>F<\/jats:italic>(<jats:italic>x<\/jats:italic><jats:sub>0<\/jats:sub>, <jats:italic>x<\/jats:italic><jats:sub>1<\/jats:sub>, <jats:italic>x<\/jats:italic><jats:sub>2<\/jats:sub>, \u2026) where the coefficient of <jats:italic>x<\/jats:italic><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xlink:href=\"graphic\/tex2gif-stack-1.gif\" xlink:title=\"urn:x-wiley:03649024:media:JGT3190030313:tex2gif-stack-1\" \/>\u2026<jats:italic>x<\/jats:italic><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xlink:href=\"graphic\/tex2gif-stack-2.gif\" xlink:title=\"urn:x-wiley:03649024:media:JGT3190030313:tex2gif-stack-2\" \/> is the number of graphs of order <jats:italic>p<\/jats:italic> having degree sequence (<jats:italic>d<\/jats:italic><jats:sub>0<\/jats:sub>, \u2026, <jats:italic>d<\/jats:italic><jats:sub>p\u20101<\/jats:sub>).<\/jats:p>","DOI":"10.1002\/jgt.3190030313","type":"journal-article","created":{"date-parts":[[2007,5,29]],"date-time":"2007-05-29T06:25:35Z","timestamp":1180419935000},"page":"295-299","source":"Crossref","is-referenced-by-count":3,"title":["Enumeration of graphs by degree sequence"],"prefix":"10.1002","volume":"3","author":[{"given":"Phil","family":"Hanlon","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":"Graphical Enumeration","author":"Harary F.","year":"1973"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1968-005-0"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0021-9800(70)80089-8"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190030313","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190030313","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,19]],"date-time":"2023-10-19T13:12:26Z","timestamp":1697721146000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190030313"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,9]]},"references-count":3,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1979,9]]}},"alternative-id":["10.1002\/jgt.3190030313"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190030313","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1979,9]]}}}