{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,2]],"date-time":"2026-08-02T06:20:47Z","timestamp":1785651647075,"version":"3.56.0"},"reference-count":9,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1998,2,1]],"date-time":"1998-02-01T00:00:00Z","timestamp":886291200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1998,2]]},"DOI":"10.1016\/s0020-0190(98)00008-8","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:32:24Z","timestamp":1049736744000},"page":"183-188","source":"Crossref","is-referenced-by-count":14,"title":["On the number of spanning trees of multi-star related graphs"],"prefix":"10.1016","volume":"65","author":[{"given":"S.D.","family":"Nikolopoulos","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"P.","family":"Rondogiannis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(98)00008-8_BIB1","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1973"},{"key":"10.1016\/S0020-0190(98)00008-8_BIB2","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1002\/jgt.3190100311","article-title":"On unreliability polynomials and graph connectivity in reliable network synthesis","volume":"10","author":"Boesch","year":"1986","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0020-0190(98)00008-8_BIB3","series-title":"Distance in Graphs","author":"Buckley","year":"1990"},{"key":"10.1016\/S0020-0190(98)00008-8_BIB4","article-title":"On the synthesis of reliable networks","author":"Li","year":"1987"},{"key":"10.1016\/S0020-0190(98)00008-8_BIB5","series-title":"Graph Theory and Theoretical Physics","first-page":"261","article-title":"Enumerating labelled trees","author":"Moon","year":"1967"},{"key":"10.1016\/S0020-0190(98)00008-8_BIB6","article-title":"Uniformly-most reliable graphs do not always exist","author":"Myrvold","year":"1989"},{"key":"10.1016\/S0020-0190(98)00008-8_BIB7","first-page":"569","article-title":"The number of trees in a certain network","volume":"10","author":"O'Neil","year":"1963","journal-title":"Notices Amer. Math. Soc."},{"key":"10.1016\/S0020-0190(98)00008-8_BIB8","first-page":"3","article-title":"On the mutual cancellation of cluster integrals in Mayer's fugacity series","volume":"83","author":"Temperley","year":"1964"},{"key":"10.1016\/S0020-0190(98)00008-8_BIB9","first-page":"1954","article-title":"Number of trees in a graph","volume":"46","author":"Weinberg","year":"1958"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098000088?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098000088?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T14:55:00Z","timestamp":1556376900000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019098000088"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,2]]},"references-count":9,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1998,2]]}},"alternative-id":["S0020019098000088"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(98)00008-8","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1998,2]]}}}